Archive for the ‘Snake’ Category:

Golem Grad by Serkan Yürekli

Golem Grad by Serkan Yürekli

PDF

or solve online (using our beta test of Penpa-Edit tools; use Tab key to alternate between line drawing and shading)

Theme: Clue Symmetry and Logic

Author/Opus: This is the 60th puzzle from our contributing puzzlemaster Serkan Yürekli.

Rules: Variation of Nurikabe. Shade some empty cells black so that the grid is divided into white areas, each containing at most one number. A white area with a number must have the same area in cells as that number. White areas may only touch diagonally. All shaded cells must be connected with each other, but no 2×2 group of cells can be entirely shaded. Also, all shaded cells must be divisible into snakes with the heads and tails given in the grid. Snakes cannot cross each other.

Also, see this example:

Golem Grad by Serkan Yürekli

Answer String: Enter the length in cells of each of the black segments from left to right for the marked rows, starting at the top. Separate each row’s entry with a comma. This example has the key “7,32,31”.

Time Standards (highlight to view): Grandmaster = 4:00, Master = 10:00, Expert = 20:00

Solution: PDF

Note: Follow this link for other variations of Nurikabe and this link for more classic Nurikabe. If you are new to this puzzle type, here are our easiest Nurikabes to get started on.

Golem Grad by Serkan Yürekli

Golem Grad by Serkan Yürekli

PDF

or solve online (using our beta test of Penpa-Edit tools; use Tab key to alternate between line drawing and shading)

Theme: Clue Symmetry and Logic

Author/Opus: This is the 59th puzzle from our contributing puzzlemaster Serkan Yürekli.

Rules: Variation of Nurikabe. Shade some empty cells black so that the grid is divided into white areas, each containing at most one number. A white area with a number must have the same area in cells as that number. White areas may only touch diagonally. All shaded cells must be connected with each other, but no 2×2 group of cells can be entirely shaded. Also, all shaded cells must be divisible into snakes with the heads and tails given in the grid. Snakes cannot cross each other.

Also, see this example:

Golem Grad by Serkan Yürekli

Answer String: Enter the length in cells of each of the black segments from left to right for the marked rows, starting at the top. Separate each row’s entry with a comma. This example has the key “7,32,31”.

Time Standards (highlight to view): Grandmaster = 3:30, Master = 4:45, Expert = 9:30

Solution: PDF

Note: Follow this link for other variations of Nurikabe and this link for more classic Nurikabe. If you are new to this puzzle type, here are our easiest Nurikabes to get started on.

Golem Grad by Serkan Yürekli

Golem Grad by Serkan Yürekli

PDF

or solve online (using our beta test of Penpa-Edit tools; use Tab key to alternate between line drawing and shading)

Theme: Clue Symmetry and Logic

Author/Opus: This is the 58th puzzle from our contributing puzzlemaster Serkan Yürekli.

Rules: Variation of Nurikabe. Shade some empty cells black so that the grid is divided into white areas, each containing at most one number. A white area with a number must have the same area in cells as that number. White areas may only touch diagonally. All shaded cells must be connected with each other, but no 2×2 group of cells can be entirely shaded. Also, all shaded cells must be divisible into snakes with the heads and tails given in the grid. Snakes cannot cross each other.

Also, see this example:

Golem Grad by Serkan Yürekli

Answer String: Enter the length in cells of each of the black segments from left to right for the marked rows, starting at the top. Separate each row’s entry with a comma. This example has the key “7,32,31”.

Time Standards (highlight to view): Grandmaster = 0:45, Master = 1:15, Expert = 2:30

Solution: PDF

Note: Follow this link for other variations of Nurikabe and this link for more classic Nurikabe. If you are new to this puzzle type, here are our easiest Nurikabes to get started on.

Three-Point Snake by Ashish Kumar

Three-Point Snake by Ashish Kumar

PDF

Theme: Logical

Author/Opus: This is the 1st puzzle from guest contributor Ashish Kumar.

Rules: Locate a snake of unknown length in the grid, whose head, tail, and exact center are given. The snake does not touch itself, even diagonally. Numbers outside the grid indicate the number of snake cells in that row/column.
See also this example:

TP Snake

Answer String: Enter the length in cells of each of the snake segments from left to right for the marked rows, starting at the top. Separate each row’s entry with a comma. This example has the key “211,31”.

Time Standards (highlight to view): Grandmaster = 4:00, Master = 9:30, Expert = 19:00

Solution: PDF

Snake by Zoltán Horváth

Snake by Zoltán Horváth

PDF

Theme: Grid Symmetry and Logic (Originally on 2014 Hungarian Puzzle Championship)

Author/Opus: This is the 3rd puzzle from guest contributor Zoltán Horváth.

Rules: Locate a snake in the grid, whose head and tail are given. The snake does not touch itself, not even diagonally, and cannot use any black squares. Numbers outside the grid indicate the number of snake cells in that row/column. See also this example:

Snake

Answer String: Enter the length in cells of each of the snake segments from left to right for the marked rows, starting at the top. Separate each row’s entry with a comma. This example has the key “2,13”.

Time Standards (highlight to view): Grandmaster = 1:15, Master = 2:00, Expert = 4:00

Solution: PDF

The Puzzle Robot #15 – The Persistence of Memory

The Persistence of Memory by Serkan Yürekli

(View image directly for larger form.)

(PNG with extra lines for solvers who want to flood-fill the path)

PDF

Theme: T

Rules: Find a path from one dot to the other by moving horizontally or vertically between adjacent squares. The path cannot touch itself, even diagonally. All highlighted regions must be used, and may be re-entered. If two or more highlighted regions have the same shape and orientation, then how the path passes through those shapes must be identical. Or see here.

Answer String: For each marked row, enter the size of each group of cells used by the path from left to right. Separate each row’s entry with a comma.

Time Standards (highlight to view): Grandmaster = 2:45, Master = 5:30, Expert = 11:00

Sunday Surprise #7 – Welcome to Serkan Yürekli

Editor’s Note: While our Sunday Surprises are meant to be unexpected, today’s surprise should be a double surprise for you. Besides the bonus puzzle, it is my great pleasure to announce that one of the world’s best puzzlemakers and the inventor of Tapa, Serkan Yürekli, is joining us as a regular contributor. (If you haven’t yet, you should check out his Tapa Variation Contests that are starting again this weekend and his Classic Tapa Contest that starts next week.)

I asked Serkan, for his debut week, to provide some of the puzzle styles I know him best for and I hope you will enjoy what is in store. Today brings a “The Persistence of Memory” puzzle that Serkan wrote with GMPuzzles in mind.

The Persistence of Memory by Serkan Yürekli

(View image directly for larger form.)

(PNG with extra lines for solvers who want to flood-fill the path)

PDF

Theme: GMPuzzles

Rules: Find a path from one dot to the other by moving horizontally or vertically between adjacent squares. The path cannot touch itself, even diagonally. All highlighted regions must be used, and may be re-entered. If two or more highlighted regions have the same shape and orientation, then how the path passes through those shapes must be identical. Or see here.

Answer String: For each marked row, enter the size of each group of cells used by the path from left to right. Separate each row with a comma.

Time Standards (highlight to view): Grandmaster = 7:30, Master = 10:30, Expert = 21:00