WPF PUZZLE GP 2018 ROUND 3 COMPETITION BOOKLET. Host Country: India + = 2 = = 18 = = = = = =

Similar documents
Swaroop Guggilam, Ashish Kumar, Rajesh Kumar, Rakesh Rai, Prasanna Seshadri

WPF PUZZLE GP 2015 COMPETITION BOOKLET ROUND 7. Puzzle authors: Switzerland Roger Kohler Fred Stalder Markus Roth Esther Naef Carmen Günther

WPF PUZZLE GP 2018 ROUND 4 COMPETITION BOOKLET. Host Country: Czech Republic

WPF PUZZLE GP 2019 ROUND 3 INSTRUCTION BOOKLET. Host Country: Serbia. Čedomir Milanović, Zoran Tanasić, Nikola Živanović NOMNONMON B NOMNONMON

WPF PUZZLE GP 2015 INSTRUCTION BOOKLET ROUND 7. Puzzle authors: Switzerland Roger Kohler Fred Stalder Markus Roth Esther Naef Carmen Günther

WPF PUZZLE GP 2018 ROUND 7 INSTRUCTION BOOKLET. Host Country: Netherlands. Bram de Laat. Special Notes: None.

WPF PUZZLE GP 2014 COMPETITION BOOKLET ROUND 1 WPF SUDOKU/PUZZLE GRAND PRIX 2014

WPF PUZZLE GP 2016 ROUND 8 INSTRUCTION BOOKLET. Host Country: Russia. Andrey Bogdanov. Special Notes: No special notes for this round.

WPF PUZZLE GP 2018 ROUND 1 COMPETITION BOOKLET. Host Country: Turkey. Serkan Yürekli, Salih Alan, Fatih Kamer Anda, Murat Can Tonta A B H G A B I H

We hope you enjoy the set. Good luck for the Indian Puzzle Championship! 3 A B C 4 H D 5 G F E 7 A B 8 H 9 G F

Name. Part 2. Part 2 Swimming 55 minutes

Inside Outside Circles Outside Circles Inside. Regions Circles Inside Regions Outside Regions. Outside Inside Regions Circles Inside Outside

WPF PUZZLE GP 2018 ROUND 2. COMPETITION BOOKLET Host Country: Switzerland. ScHWeIZ. ScHWeiz. schweiz. SchWEIZ. SchwEiz. SchWEiZ. schweiz.

FEATURES 24 PUZZLES, ASSORTED MIX, MOSTLY THEMED ON 24 HPC. HINTS FOR EACH PUZZLE. SOLUTIONS FOR EACH PUZZLE.

1. Hex Tapa (12 points) 2. Hex Dominos (13 points)

Episode 3 16 th 19 th March Made In India and Regions by Prasanna Seshadri

WPF PUZZLE GP 2016 ROUND 6 INSTRUCTION BOOKLET. Host Country: Serbia. Nikola Živanović, Čedomir Milanović, Branko Ćeranić

WPF SUDOKU/PUZZLE GRAND PRIX 2014 WPF SUDOKU GP 2014 COMPETITION BOOKLET ROUND 4. Puzzle authors: Russia Andrey Bogdanov, Olga Leontieva.

Part III F F J M. Name

INSTRUCTION BOOKLET (v2)

WPF PUZZLE GP 2016 ROUND 2 INSTRUCTION BOOKLET. Puzzle Authors: Slovakia. Matus Demiger. General Notes: None for this round. Points, Casual Section:

3 rd -4 th September minutes

WPF PUZZLE GP 2015 INSTRUCTION BOOKLET ROUND 6. Puzzle authors: Germany Rainer Biegler Gabi Penn-Karras Roland Voigt Ulrich Voigt.

WPF PUZZLE GP 2018 ROUND 2 INSTRUCTION BOOKLET. Host Country: Switzerland. Markus Roth, Roger Kohler, Esther Naef

LMI Monthly Puzzle Test. 9 th /10 th July minutes

Episode 5 11 th 14 th May Casual & Word by Rakesh Rai

WPF PUZZLE GP 2017 ROUND 5A COMPETITION BOOKLET. Host Country: Czech Republic C D. Author: Jan Novotný

WPF SUDOKU/PUZZLE GRAND PRIX 2014 WPF PUZZLE GP 2014 COMPETITION BOOKLET ROUND 3. Puzzle authors: Japan. Organised by

F F J M. Name. Part I

17/01/14: Pentominous by Carl Worth Theme: Just One (in Roman Numerals)

IN THIS ISSUE

WPF PUZZLE GP 2016 ROUND 6 COMPETITION BOOKLET. Host Country: Serbia. Nikola Živanović, Čedomir Milanović, Branko Ćeranić COMPETITIVE

BmMT 2015 Puzzle Round November 7, 2015

IN THIS ISSUE. Cave vs. Pentagroups

IN THIS ISSUE. WPC Placement. WPC Placement Puzzles of the th Belarusian Puzzle Championship. Puzzles of the

Indian Puzzle Championship 2013

Tapa Variations Contest

1. Rectangles 20 points

Quintessence A Packet of Puzzles by John Bulten

Instruction booklet EVOLVED TERRESTRIALS. 16th-17th April 2011

puzzles may not be published without written authorization

15/03/23: BACA by John Bulten Theme: Beach Booty

Instructions Booklet. 26th WPC INDIA 2017 LOGIC MASTERS INDIA. THURSDAY, 19th OCTOBER Session 1. Session 2. FRIDAY, 20th OCTOBER Session 3.

LMI October Puzzle Test 1 9/10 October Minutes N I K O LI SELECTION. by Tom detuned Collyer http//blogs.warwick.ac.

1st UKPA Sudoku Championship

Serbian round at Logic Masters India

Dutch Sudoku Advent 1. Thermometers Sudoku (Arvid Baars)

WPF SUDOKU GP 2014 ROUND 2 WPF SUDOKU/PUZZLE GRAND PRIX Puzzle authors: Serbia. Organised by

Rounds: 2780 points 3 hours 45 minutes

13 TH 24 HOURS PUZZLE CHAMPIONSHIP

LMI-MONTHLY TEST JUN 2010 'SPEED SIXES'

SUDOKU Mahabharat. Episode 3 15 th 17 th November. Odd Even Variations by Deb Mohanty

Name. WPC French Qualifier Part I

SUDOKU SURPRISE. Hosted by Logic Masters India November Puzzles set by David McNeill Tested by Tom Collyer, Yuhei Kusui and Robert Vollmert

It Stands to Reason: Developing Inductive and Deductive Habits of Mind

UN DOS TREZ Sudoku Competition. Puzzle Booklet for Preliminary Round. 19-Feb :45PM 75 minutes

POST TEST KEY. Math in a Cultural Context*

SUDOKU Mahabharat. Episode 7 21 st 23 rd March. Converse by Swaroop Guggilam

Instructions Booklet. 12th WSC INDIA 2017 LOGIC MASTERS INDIA. MONDAY, 16th OCTOBER Session 1. Session 2. TUESDAY, 17th OCTOBER Session 3.

GET OVERLAPPED! Author: Huang Yi. Forum thread:

LMI Monthly Test May 2010 Instruction Booklet

Sudoku Xtra. Sudoku Xtra 1. >> The Logic Puzzle Brain Workout. Issue 8 - July Expanded Community Section! >> Samurai Sudoku 6x6: S

Monthly Sudoku Contest for September th 17 th September Enthralling Sudoku By Ashish Kumar

Colossal Cave Collection Sampler

Episode 6 9 th 11 th January 90 minutes. Twisted Classics by Rajesh Kumar

Preview Puzzle Instructions U.S. Sudoku Team Qualifying Test September 6, 2015

T G D T LMI PUZZLE TEST DUTCH TREAT WITH A GERMAN TWIST 7 TH 9 TH SEPTEMBER 2013 BY RICHARD STOLK INSTRUCTION BOOKLET GOOD LUCK AND HAVE FUN!

Diagonal Vision LMI March Sudoku Test

Episode 5 26 th 28 th December

Indian Sudoku Championship 2015

INSTRUCTION BOOKLET SUDOKU MASTERS 2008 NATIONAL SUDOKU CHAMPIONSHIP FINALS Q&A SESSION 10:30 10:50 PART 1 CLASSICS 11:00 11:35

PART 2 VARIA 1 TEAM FRANCE WSC minutes 750 points

Logic Masters Instructions, First round

WPF SUDOKU/PUZZLE GRAND PRIX 2014 WPFSUDOKU GP 2014 COMPETITIONBOOKLET ROUND6. Puzzle authors: Bulgaria Deyan Razsadov.

5CHAMPIONSHIP. Individual Round Puzzle Examples SUDOKU. th WORLD. from PHILADELPHIA. Lead Sponsor

LMI SUDOKU TEST 7X JULY 2014 BY RICHARD STOLK

Sudoku Mock Test 5. Instruction Booklet. 28 th December, IST (GMT ) 975 points + Time Bonus. Organized by. Logic Masters: India

Table of Contents. Table of Contents 1

Tapa Variations Contest

Logic Masters India. Sample Booklet

Inductive Reasoning Practice Test. Solution Booklet. 1

UK Puzzle Association Sudoku Championship 2012 All puzzles by Gareth Moore

AKIL OYUNLARI MAGAZINE COMPETITION. 18 th - 20 th AUGUST 120 MINUTES

Triangles, Rectangles, Squares, and Circles

Building Concepts: Fractions and Unit Squares

Melon s Puzzle Packs

Standard Sudoku point. 1 point. P a g e 1

Booklet SUDOKUCUP 2. Kabròáci SUDOKUCUP.COM

Episode 3 8 th 12 th February Substitution and Odd Even Variations By Kishore Kumar and Ashish Kumar

Grade 6 Math Circles March 7/8, Magic and Latin Squares

Figure 1: The Game of Fifteen

Prague. Prague th WSC 27th WPC HALAS. 27th World Puzzle Championship. Instruction booklet. Partners

MAGAZINE MIXED PUZZLES FREE PUZZLES INSIDE! Keep your brain active!

ENGR 1182 Exam 1 First Mid Term Exam Study Guide and Practice Problems

Meaningful Ways to Develop Math Facts

Unit 5 Shape and space

Whole Numbers WHOLE NUMBERS PASSPORT.

Standard Puzzle Format

Logic Masters India Presents. April 14 16, 2012 April 2012 Monthly Sudoku Test INSTRUCTION BOOKLET

ENGINEERING GRAPHICS ESSENTIALS

Transcription:

Host Country: India WPF PUZZLE GP 0 COMPETITION BOOKLET ROUND Swaroop Guggilam, Ashish Kumar, Rajesh Kumar, Rakesh Rai, Prasanna Seshadri Special Notes: The round is presented with similar-style puzzles in three sections: simple rules, well-known types, and complex variations. An earlier version of this booklet had a malformed version of puzzle 6; the puzzle displays correctly but printed incorrectly on some printers.. Numbers: Arithmetic Square [Rakesh Rai] (9 points) Place the numbers from to 9 into the cells (a different single number in each cell) so that the indicated equations/relations are correct. Evaluate from left-to-right and top-to-bottom (ignore the usual precedence of the operators). It is possible for expressions and partial expressions to be negative or non-integral. Answer: For each designated row, enter the contents of the cells, in order from left to right. Example Answer: 97,6,5. Paths: Arukone [Rakesh Rai] (6 points) 9 + + 7 > + + 6 = 5 + = = = = 75 9 Some cells in the grid are marked with numbers; each number appears exactly twice and no cell contains more than one number. For each pair of identical numbers, draw a path that connects those two numbers. The paths must go through orthogonally adjacent cells. Each cell may be visited by at most one path, and may not be visited more than once by that path. (It is permissible for a cell to not be visited by any path.) The dots in cells are only used for entering your answers. a b c + = = 0 + + + = = = = 0 7 5 6 6 5 Answer: Enter one digit for each of the dotted cells, from left to right. If the path does not go through the cell, enter a single digit 0. Otherwise, enter the number associated with the path that goes through the cell. Use only the last digit for two digit numbers; e.g., use 0 if the dot is on the path that connects 0 and 0. Example Answer: 0 7 0

ROUND. Paths: Arukone [Rakesh Rai] (6 points) Answer: Enter one digit for each of the dotted cells, from left to right. If the path does not go through the cell, enter a single digit 0. Otherwise, enter the number associated with the path that goes through the cell. Use only the last digit for two digit numbers; e.g., use 0 if the dot is on the path that connects 0 and 0. Example Answer: 0 5 6 7 0 6 7 5. Objects: Gaps [Rajesh Kumar] (5 points) Blacken some cells in the grid such that each row and each column contains exactly two blackened cells. The numbers to the left of (or above) the grid indicate the number of unblackened cells between the blackened cells in that row (or column). The numbers on the far top of the diagram are for Answer purposes only. Answer: For each row from top to bottom, enter the number of the first column from the left where a blackened cell appears (the number on top of that column). Use only the last digit for two-digit numbers; e.g., use 0 if the first blackened cell appears in column 0. Example Answer: 0 5 6 7 9 0 5 0 5

ROUND 5-6. Loop: Simple Loop [Swaroop Guggilam] (, points) Draw a single closed loop (without intersections or crossings) through the centers of all white cells. Loop paths must be orthogonal. 5 A B The letters in the grid are for Answer purposes only. Answer: Starting at the A in the upper-left and heading to the right, enter the letters in the grid in the order in which the loop encounters them, ending at the letter A (again). C D Example Answer: ACEDBA E B A C F D E G H I 6 A B C D E F G H I J K L M N O

ROUND 7-. Regions: Shikaku [Prasanna Seshadri] (, points) Divide the grid into rectangles along the grid lines such that each cell is in exactly one rectangle and each rectangle contains exactly one given number. The number must equal the area of the rectangle (in cells). The dots in cells are only used for entering your answers. Answer: Enter the number in the rectangle each dot is in, reading the dots from left to right. (Ignore which row the dots are in.) Use only the last digit for two-digit numbers; e.g., use 0 for a rectangle with a 0 inside it. Example Answer: 0667 6 0 6 6 6 6 6 6 6 7 7 0 6 6 7 9 6 6 5 9 6 9 6 6

ROUND 9-0. Shading: Lakes [Ashish Kumar] (, points) Shade some cells black (leaving the other cells white) so that the grid is divided into black and white regions. (Cells of the same color are considered in the same region if they are adjacent horizontally or vertically.) Each given number must be in a white region that has the same area in cells as that number. Each white region must have exactly one given number. (There is no constraint on the number, size, or shape of black regions.) Answer: For each designated row, enter the lengths (number of cells) of the white (not black) segments from left to right. If there are no white cells in the row, enter a single digit 0. Use only the last digit for two-digit numbers; e.g., use 0 for an white segment of length 0. Example Answer:, 9a 9b 5 9 5 6 0a 0b 5 7 6

ROUND. Numbers: TomTom [Rakesh Rai] (7 points) Place a number from to X into each cell so that each number appears exactly once in each row and column. (X is the number of cells in each row.) Numbers may repeat within a region. The number in the upper-left corner of each outlined region indicates the value of one of the four basic operations applied to all numbers in the region, starting with the largest number for subtraction and division (e.g.,,, with division has a clue of as =). The operation may or may not be given in the region, but at least one of the four operations must apply. Answer: For each designated row, enter its contents, from left to right. Use only the last digit for two digit numbers; e.g., use 0 for a cell that contains the number 0. {-5} + 000 5 5 5 5 5 Example Answer: 5,5 {-6} 0 a 0 b 0

ROUND -. Paths: Snake [Ashish Kumar] (5, points) Locate a snake in the grid. The snake is a path that starts in a cell, goes through some number of cells orthogonally, and ends in a cell. The snake cannot go through any cells marked with. Each cell is used at most once by the snake. The snake may not loop around to touch itself, not even diagonally. (In other words, if two cells in the snake touch orthogonally, then they must be exactly one cell apart along the path of the snake, and if two cells in the snake touch diagonally, then they must be exactly two cells apart along the path of the snake.) Numbers outside the grid, if given, indicate how many cells in that row or column are occupied by the snake. The two cells containing the ends of the snake are shaded. Answer: For each designated row, enter its contents. Use O for a cell occupied by the snake and X for a cell not occupied by the snake. You may reverse the two symbols, as long as you are consistent. Example Answer: OOXXX,XXXOO a b 5 a b

ROUND. Objects: Star Battle [Rajesh Kumar] ( points) Place stars into some cells in the grid, no more than one star per cell. Each row, each column, and each outlined region must contain exactly two stars. Cells with stars may not touch each other, not even diagonally. 5 6 7 9 The numbers on top of the diagram are for Answer purposes only. Answer: For each row from top to bottom, enter the number of the first column from the left where a star appears (the number on top of that column). Use only the last digit for two-digit numbers; e.g., use 0 if the first star appears in column 0. Example Answer: 6675 5 6 7 9 0

ROUND 5-6. Loop: Rows Yajilin[Swaroop Guggilam] (9, 6 points) Blacken some white cells and then draw a single closed loop (without intersections or crossings) through all remaining white cells. Loop paths must be orthogonal. Blackened cells cannot share an edge with each other. Some cells are outlined and in gray and cannot be part of the loop. Each number to the right and bottom of the grid reveals the number of blackened cells that must be located in that row or column. The numbers on the top of the diagram and the circles on the side are for Answer purposes only. Answer: For each row from top to bottom, enter the column number of the left-most blackened cell. (Outlined gray cells are not blackened.) Use only the last digit for two digit numbers; e.g., use 0 for column 0. If none of the cells in a row are blackened, enter 0 for that row. Example Answer: 5005 7 5 0 0 5 5 0 6 5 5 6 7 5 6 7 9 0

ROUND 7-. Regions: Fillomino [Prasanna Seshadri] (, 7 points) Divide the grid along the dotted lines into regions (called polyominoes) so that no two polyominoes with the same area share an edge. Inside some cells are numbers; each number must equal the area of the polyomino it belongs to. A polyomino may contain zero, one, or more of the given numbers. (It is possible to have a hidden polyomino: a polyomino without any of the given numbers. Hidden polyominoes may have any area, including a value not present in the starting grid, such as a 6 in a puzzle with only clues numbered -5.) The dots in cells are only used for entering your answers. Answer: Enter the area of the polyomino each dot is in, reading the dots from left to right. (Ignore which row the dots are in.) Use only the last digit for two-digit numbers; e.g., use 0 for a polyomino of size 0. Example Answer: 5655 7 7 7 6 6 6 5 5 5 5 6 5 5 7 5 5 5 5

ROUND 9-0. Shading: Nurikabe [Ashish Kumar] (, 6 points) Shade some cells black (leaving the other cells white) so that the grid is divided into non-overlapping regions; cells of the same color are considered in the same region if they are adjacent along edges. Each given number must be in a white region that has the same area in cells as that number. Each white region must have exactly one given number. All black cells must be in the same region. No group of cells can be entirely shaded black. Answer: For each designated row, enter the lengths (number of cells) of the black segments from left to right. If there are no black cells in the row, enter a single digit 0. Use only the last digit for two-digit numbers; e.g., use 0 for a black segment of length 0. 9a 9b 5 5 5 Example Answer: 5,, 9c 5 0a 0b 0c 0 5 5

ROUND. Numbers: TomTom Operations[Rakesh Rai] ( points) Place a number from to X into each cell so that each number appears exactly once in each row and column. (X is the number of cells in each row.) Numbers may repeat within a region. The number in the upper-left corner of each outlined region indicates the value of the given operation applied to all numbers in the region, starting with the largest number for subtraction and division (e.g.,,, with division has a clue of as =). The number may or may not be given in the region; but its value must be a whole number (that is, not negative or fractional a value of 0 is permitted). Answer: For each designated row, enter its contents, from left to right. Use only the last digit for two digit numbers; e.g., use 0 for a cell that contains the number 0. {-5} + + 5 5 5 5 + 5 Example Answer: 5,5 {-6} + a b

ROUND -. Paths: Snakes [Prasanna Seshadri] (, points) Locate many snakes in the grid. A snake is a path that starts in a cell, goes through some number of cells orthogonally, and ends in a cell. A snake cannot go through any cells marked with. Each cell is used at most once by any snake. A snake may not loop around to touch itself or touch other snakes, not even diagonally. (In other words, if two cells in any snakes touch orthogonally, then they must be exactly one cell apart along the path of the same snake, and if two cells in any snakes touch diagonally, then they must be exactly two cells apart along the path of the same snake.) Numbers outside the grid, if given, indicate how many cells in that row or column are occupied by snakes. The cells containing the ends of all snakes are shaded. a b 5 5 5 Answer: For each designated row, enter its contents. Use O for a cell occupied by the snake and X for a cell not occupied by the snake. You may reverse the two symbols, as long as you are consistent. 5 Example Answer: OXXOO,OOXXO 6 6 a b

ROUND. Objects: Half-Region Star Battle [Rajesh Kumar] ( points) Place stars into some cells in the grid, no more than one star per cell. Each row and each column must contain exactly two stars. Each outlined region must contain exactly one star. Cells with stars may not touch each other, not even diagonally. 5 6 7 9 The numbers on top of the diagram are for Answer purposes only. Answer: For each row from top to bottom, enter the number of the first column from the left where a star appears (the number on top of that column). Use only the last digit for twodigit numbers; e.g., use 0 if the first star appears in column 0. Example Answer: 6675 5 6 7 9 0

ROUND 5-6. Loop: No-touch Masyu [Swaroop Guggilam] (0, 7 points) Draw a single loop that passes orthogonally through centers of cells. The loop must go through all circled cells. The loop may not intersect itself or enter the same cell more than once. The loop must go straight through the cells with white circles, with a turn in at least one of the cells immediately before or after each white circle. The loop must make a turn in all the black circles, but must go straight in both cells immediately before and after each black circle. Unused cells (cells that the loop does not go through) cannot share an edge with each other. 5a Answer: For each designated row, enter the letter for each cell, from left to right. The letter for a cell is I if the path goes straight through the cell, L if the path turns in the cell, and X if the path does not go through the cell. Example Answer: LIILX,ILLLL 5a 5b b 6a 6b

ROUND 7-. Regions: Fillomino Rectangles [Prasanna Seshadri] (, 7 points) Divide the grid along the dotted lines into rectangles so that no two rectangles with the same area share an edge. Inside some cells are numbers; each number must equal the area of the rectangle it belongs to. A rectangle may contain zero, one, or more of the given numbers. (It is possible to have a hidden rectangle: a rectangle without any of the given numbers. Hidden rectangles may have any area, including a value not present in the starting grid, such as a 6 in a puzzle with only clues numbered -5.) The dots in cells are only used for entering your answers. Answer: Enter the area of the rectangle each dot is in, reading the dots from left to right. (Ignore which row the dots are in.) Use only the last digit for two-digit numbers; e.g., use 0 for a polyomino of size 0. Example Answer: 56 6 6 5 6 6 6 6 6 6 5 5 6 7 9 6 9 9

ROUND 9-0. Shading: Skyscraper Nurikabe [Ashish Kumar] (, points) Shade some cells black (leaving the other cells white) so that the grid is divided into non-overlapping regions; cells of the same color are considered in the same region if they are adjacent along edges. Each given number inside the grid must be in a white region that has the same area in cells as that number. Each white region must have exactly one given number. All black cells must be in the same region. No group of cells can be entirely shaded black. The numbers outside the grid indicate how many black segments (groups of adjacent black cells) can be seen in the respective row or column from the respective direction; shorter and equal-length segments are hidden behind longer ones. Answer: For each designated row, enter the lengths (number of cells) of the black segments from left to right. If there are no black cells in the row, enter a single digit 0. Use only the last digit for two-digit numbers; e.g., use 0 for a black segment of length 0. Example Answer:,7 a b 6 0a 9a 9b 9c 5 0b 6 7 9 0c