Archive for the ‘Snake’ Category:

Persistence of Memory by Prasanna Seshadri

Persistence of Memory by Prasanna Seshadri

PDF

Theme: Tetrominoes

Author/Opus: This is the 186th puzzle from our contributing puzzlemaster Prasanna Seshadri.

Rules: Draw a snake (a 1-cell wide path) from one dot to the other by moving horizontally or vertically between adjacent squares. The snake cannot touch itself, not even diagonally. All highlighted regions must be visited by the snake, 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.

Difficulty: 3 stars

Time Standards (highlight to view): Grandmaster = 4:45, Master = 7:30, Expert = 15:00

Solution: To be posted next Sunday (September 20th).

Note: Follow this link for other Snake puzzles. More Snake puzzles and variations can be found in Snake and Variations by Serkan Yürekli.

Snake Egg by Joseph Howard

Snake Egg by Joseph Howard

PDF

Theme: High-Low

Author/Opus: This is the 20th puzzle from guest contributor Joseph Howard.

Rules: Draw a snake (a 1 cell-wide path) in the grid whose head and tail are given by circled cells. The snake can touch itself diagonally, but cannot touch itself orthogonally or revisit any square. Besides the snake, the remaining cells must form exactly nine white areas, one of each size from 1 to 9 (in example, 1 to 5). Numbers in the grid must be part of white areas of the indicated size.

See also this example:

Snake Egg by Serkan Yürekli

Difficulty: 3 stars

Time Standards (highlight to view): Grandmaster = 3:15, Master = 6:45, Expert = 13:30

Solution: To be posted next Sunday (September 20th).

Note: Follow this link for other Snake puzzles. More Snake puzzles and variations can be found in Snake and Variations by Serkan Yürekli.

Dotted Snake by Serkan Yürekli

Dotted Snake by Serkan Yürekli

PDF

Author/Opus: This is the 297th puzzle from our managing editor Serkan Yürekli.

Rules: Locate a numbered snake (a 1-cell wide path) that starts with 1 and goes to 45. The snake cannot touch itself, not even diagonally. Every third segment of the snake is marked with gray. Digits outside the grid indicate the number of gray snake segments in that row or column.

See also this example:

Dotted Snake by Serkan Yürekli

Difficulty: 2.5 stars

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

Solution: To be posted next Sunday (September 20th).

Note: Follow this link for other Snake puzzles. More Snake puzzles and variations can be found in Snake and Variations by Serkan Yürekli.

Graffiti Snakes by Murat Can Tonta

Snake (Graffiti) by Murat Can Tonta

PDF

Theme: Twos

Author/Opus: This is the 177th puzzle from our contributing puzzlemaster Murat Can Tonta.

Rules: Blacken some cells and then locate two snakes (1-cell wide paths). The snakes do not touch themselves or each other, not even diagonally. All remaining white cells must be part of the snakes with the heads and tails given in the grid. Outside clues indicate the size of all groups of blackened cells in that row or column in order. There must be at least one white cell between each of these groups. When no clues are given, any number of cells may be shaded in that row/column.

Difficulty: 2 stars

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

Solution: To be posted next Sunday (September 20th).

Note: Follow this link for other Snake puzzles. More Snake puzzles and variations can be found in Snake and Variations by Serkan Yürekli.

Snake by Ashish Kumar

Snake by Ashish Kumar

PDF

Theme: Divisible by 3

Author/Opus: This is the 53rd puzzle from our contributing puzzlemaster Ashish Kumar.

Rules: Locate a snake (a 1-cell wide path) of unknown length in the grid, whose head and tail are given. The snake does not touch itself, even diagonally. Numbers outside the grid indicate the number of snake cells in that row/column.

Difficulty: 1.5 stars

Time Standards (highlight to view): Grandmaster = 0:50, Master = 1:30, Expert = 3:00

Solution: To be posted next Sunday (September 20th).

Note: Follow this link for other Snake puzzles. More Snake puzzles and variations can be found in Snake and Variations by Serkan Yürekli.

Snake (Graffiti) by Prasanna Seshadri

Snake (Graffiti) by Prasanna Seshadri

PDF

Author/Opus: This is the 183rd puzzle from our contributing puzzlemaster Prasanna Seshadri.

Rules: Blacken some cells to leave behind a snake (a 1-cell wide path) in white cells that doesn’t touch itself, not even diagonally. All white cells must be part of the snake with the head and tail given in the grid. Outside clues indicate the size of all groups of blackened cells in that row or column in order. There must be at least one white cell between each of these groups. When no clues are given, any number of cells may be shaded in that row/column.

Difficulty: 3 stars

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

Solution: PDF; a solution video is also available here.

Note: Follow this link for other Snake puzzles.

Swivelling Serpents [Birthday Surprise] by Prasanna Seshadri

(Note: This bonus puzzle is being posted today to mark the occasion of Prasanna’s birthday.)

Swivelling Serpents by Prasanna Seshadri

PDF

Theme: One Away from Thirty

Author/Opus: This is the 180th puzzle from our contributing puzzlemaster Prasanna Seshadri.

Rules: Locate two snakes in the grid. Each snake must start from one of the gray circles, but has an unknown ending point. Black circles represent an interior cell of one of the snakes, and all black circles must be part of a snake. Each snake’s path is allowed to move vertically, horizontally, or diagonally between cells. An interior snake cell can only be adjacent to two other snake cells (including diagonally adjacent cells) and an end of the snake can only be adjacent to one other snake cell (including diagonally adjacent cells). The two different snakes must not share any adjacent cells.

There are some numbers outside the grid. These numbers indicate the number of vertical or horizontal edges (not corners) that snakes cross in that direction.

There are some letters inside the grid. For each distinct letter, exactly one of its instances is visited by one of the two snakes.

Also see this example:

Swivelling Serpents Example

Solution: PDF