Sea Serpent by Serkan Yürekli

Sea Serpent by Serkan Yürekli

PDF

or solve online (using our beta test of Penpa-Edit tools; use tab to alternate between a shading mode and a composite mode where left click inside cell shades square, left click + drag draws line segment, right click inside cell adds dot, and right click on cell edge adds an x.)

Theme: Clue Symmetry and Logic

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

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 and cannot pass through any blackened cells. The given numbers show the total number of cells are used by the snake in the grid along the indicated directions. (Numbers see to the border of the grid.)

Sea Serpent by Serkan Yürekli

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. The answer to the example is “13,2”.

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

Solution: PDF

Note: Follow this link for other Snake puzzles.

Sigma Snake by Serkan Yürekli

Sigma Snake by Serkan Yürekli

PDF

or solve online (using our beta test of Penpa-Edit tools; use tab to alternate between a letter entry mode and a shading mode. CAPS LOCK is recommended for letter entry.)

Theme: Clue Symmetry and Logic

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

Rules: Add letters to some empty cells to make a snake that doesn’t touch itself, not even diagonally. The snake’s head and tail are indicated by circles. The snake is made out of spelled out numbers, and some letters are given that must be part of the snake. Each numbered cell indicates the total sum of the distinct words that touch that cell, including diagonally. Not all words need to be used, but no word is used more than once.

Moc Macek by Serkan Yürekli

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. The answer to the example is “3,31”.

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

Solution: PDF

Note: Follow this link for other Snake puzzles.

Snake Egg by Serkan Yürekli

Snake Egg by Serkan Yürekli

PDF

or solve online (using our beta test of Penpa-Edit tools using a composite mode where left click inside cell shades square, left click + drag draws line segment, right click inside cell adds dot, and right click on cell edge adds an x.)

Theme: First Born Eggs

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

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. Numbers in the grid must be part of white areas of the indicated size.
(Also see here)

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.

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

Solution: PDF

Note: Follow this link for other Snake puzzles.

The Persistence of Memory by Serkan Yürekli

Persistence of Memory by Serkan Yürekli

PDF

or solve online (using our beta test of Penpa-Edit tools using a composite mode where left click inside cell shades square, left click + drag draws line segment, right click inside cell adds dot, and right click on cell edge adds an x.)

Theme: Quadrilaterals

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

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.

Answer String: Enter the number of cells used by each snake segment from left to right for the marked rows, starting at the top. Use both digits for any two-digit number. Separate each row’s entry with a comma.

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

Solution: PDF

Note: Follow this link for other Snake puzzles.

Easy as Pentomino Snake by Serkan Yürekli

Easy as Pentomino Snake by Serkan Yürekli

PDF

or solve online (using our beta test of Penpa-Edit tools using a composite mode where left click inside cell shades square, left click + drag draws line segment, right click inside cell adds dot, and right click on cell edge adds an x.)

Theme: Clue Symmetry and Logic

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

Rules: Draw a snake (a 1-cell wide path) out of pentominoes that doesn’t touch itself, not even diagonally. The head and tail of the snake are given by circles. Pentominoes can be rotated/reflected, and can be used more than once. The letters outside the grid represent the first pentomino visible in the corresponding direction.

Easy as Pentomino Snake by Serkan Yürekli

Answer String: Enter the number of cells used by 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. The example has the answer “211,231”.

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

Solution: PDF

Note: Follow this link for other Snake puzzles.

Moc Macek by Serkan Yürekli

Moc Macek by Serkan Yürekli

PDF

or solve online (using our beta test of Penpa-Edit tools using a composite mode where left click inside cell shades square, left click + drag draws line segment, right click inside cell adds dot, and right click on cell edge adds an x.)

Theme: Clue Symmetry and Logic

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

Rules: Draw one or more horizontal or vertical lines from each numbered cell to cover that number of empty cells. Lines cannot cross other lines or other numbered cells. The remaining empty cells are occupied by a snake (a 1-cell wide path) whose head and tail are given. The snake cannot touch itself, not even diagonally.

Moc Macek by Serkan Yürekli

Answer String: Enter the number of cells used by 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. The example has the answer “2,3”.

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

Solution: PDF

Note: Follow this link for other Snake puzzles.

Word Connection by Serkan Yürekli

Word Connection by Serkan Yürekli

(View image directly for larger form.)

PDF

or solve online (using our beta test of Penpa-Edit tools; use tab to alternate between lineox mode where left click+drag draws lines and left click in a square marks O and X, and a Letter entry mode.)

Theme: Solar System (words come from Italian, French, Hindi, Norwegian, Greek, English, Welsh, Farsi, and Arabic)

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

Rules: Place the words into the grid (one letter per cell) so that they do not touch each other, not even diagonally, and so that they can be read in a straight line in a vertical or horizontal direction. Some letters in the words are already given in the grid. Then find a path that passes through every cell of the grid, starting with the first letter of the first word, passing through the words in order from their first letters to their last letters, and ending at the last letter of the last word.

Or see this example:

Answer String: Enter the number of turns the path takes between each of the words in order as a single string of numbers. (Ignore turns in cells with letters.) The answer for this example is “224”.

Time Standards (highlight to view): Grandmaster = 6:30, Master = 11:00, Expert = 22:00

Solution: PDF

Word Connection by Serkan Yürekli

Word Connection by Serkan Yürekli

(View image directly for larger form.)

PDF

or solve online (using our beta test of Penpa-Edit tools; use tab to alternate between lineox mode where left click+drag draws lines and left click in a square marks O and X, and a Letter entry mode.)

Theme: Numbers

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

Rules: Place the words into the grid (one letter per cell) so that they do not touch each other, not even diagonally, and so that they can be read in a straight line in a vertical or horizontal direction. Some letters in the words are already given in the grid. Then find a path that passes through every cell of the grid, starting with the first letter of the first word, passing through the words in order from their first letters to their last letters, and ending at the last letter of the last word.

Or see this example:

Answer String: Enter the number of turns the path takes between each of the words in order as a single string of numbers. (Ignore turns in cells with letters.) The answer for this example is “224”.

Time Standards (highlight to view): Grandmaster = 3:45, Master = 7:00, Expert = 14:00

Solution: PDF

Word Connection by Serkan Yürekli

Word Connection by Serkan Yürekli

PDF

or solve online (using our beta test of Penpa-Edit tools; use tab to alternate between lineox mode where left click+drag draws lines and left click in a square marks O and X, and a Letter entry mode.)

Theme: Days of the Week

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

Rules: Place the words into the grid (one letter per cell) so that they do not touch each other, not even diagonally, and so that they can be read in a straight line in a vertical or horizontal direction. Some letters in the words are already given in the grid. Then find a path that passes through every cell of the grid, starting with the first letter of the first word, passing through the words in order from their first letters to their last letters, and ending at the last letter of the last word.

Or see this example:

Answer String: Enter the number of turns the path takes between each of the words in order as a single string of numbers. (Ignore turns in cells with letters.) The answer for this example is “224”.

Time Standards (highlight to view): Grandmaster = 2:00, Master = 3:00, Expert = 6:30

Solution: PDF

Crisscross with Pentominoes by Serkan Yürekli

Crisscross with Pentominoes by Serkan Yürekli

PDF

or solve online (using our beta test of Penpa-Edit tools; use tab to alternate between a letter entry mode and a shading mode to mark off cells).

Theme: Just Pentomino Letters

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

Rules: Locate the given words in the grid, reading across and down. All words should be interconnected and no words other than those in the word list should appear. All cells that are not part of the crisscross belong to one of the twelve pentominoes. Pentominoes can only touch each other at corners. Rotations and reflections of the pentominoes are allowed. The letters inside the grid are either part of the words, or part of a pentomino (and they must belong to a pentomino shape with that letter).

Or see this example:

Crisscross with Pentominoes by Serkan Yürekli

Answer String: Enter all crisscross letters (ignore pentominoes) from left to right for the marked rows, starting at the top. Separate each row’s entry with a comma. Use CAPITAL LETTERS.

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

Solution: PDF

Note: Follow this link for other puzzles involving Pentominoes.