# Puzzle 85: Nanro Signpost

One more Nanro Signpost.

Rules Shade some cells, so that all shaded cells are connected, and such that shaded cells don’t fill any 2×2 square. Clues indicated the number of shaded cells in an area; each area must have at least one shaded cell. Whenever two shaded cells touch across walls, the number of shaded cells within both areas must be different.

Or see the instruction booklet, with a somewhat different formulation of the rules.

# Puzzle 84: Nanro Signpost

One more practice puzzle, a Nanro Signpost.

Rules Shade some cells, so that all shaded cells are connected, and such that shaded cells don’t fill any 2×2 square. Clues indicated the number of shaded cells in an area; each area must have at least one shaded cell. Whenever two shaded cells touch across walls, the number of shaded cells within both areas must be different.

Or see the instruction booklet, with a somewhat different formulation of the rules.

# Puzzle 81: Twopa

Here’s a Twopa puzzle that I probably made in preparation for the German GP round.

Rules Solve each grid as a regular Tapa, such that the configuration of shaded cells around each clue differs between the two grids. The solution is unique up to swapping the grids.

Or see the GP instruction booklet.

# Puzzle 55: Slovak Sums

Here’s another GP preview puzzle. It’s a bit degenerate, but maybe it’s still useful? For this type, there’s a bit more material out there:

Rules Place digits from 1 to 4 in some blank cells, so that each row and column contains each digit exactly once. Clue numbers indicate the sum of orthogonally adjacent digits. The number of circles under a clue number indicates the number of digits involved in this sum. Or see the instruction booklet.

# Puzzle 48: Aussichtspunkte

This is a puzzle I found in the depths of my puzzle folder. I probably made it after struggling with the puzzles of this type on the contest Best of HCS, which featured one that is thematically similar. EDIT Replaced by a non-broken if less pretty version.

Rules Split the grid into 5 orthogonally connected areas of 5 cells each. The given numbers indicate how many cells within the area can be seen horizontally and vertically, including the cell itself. The givens are in those cells where this number is maximal for the corresponding area.

Or see the puzzle wiki for German instructions that include an example.

# Puzzle 30: Crystal Mine

Here’s another Crystal Mine puzzle. I didn’t dare post this before the GP, worried it might spoil the GP puzzle. That turned out to be completely different, naturally.

# Puzzle 23: Maximal Lengths

Here’s another GP preview puzzle, a nice and easy Maximal Lengths. (There’s a harder one in the queue.)

Rules Draw a loop that visits each cell, such that the longest loop segment in clued rows or columns is equal to the clue. (Length is equal to the number of crossed grid lines.)

Or see the instruction booklet.

# Puzzle 22: Japanese Sums and Loop

The Czech round of the puzzle GP will take place next week, the instruction booklet has been posted. Here’s a practice puzzle for one of the types.

Rules Place numbers from 1 to 6 in some cells so that no number repeats within a row or column. For rows and columns that have clues given on the outside, these numbers correspond to all sums of blocks of adjacent digits within that line, in the correct order. Furthermore, draw a loop that visits all cells without a number, passing horizontally and vertically from cell centre to cell centre.

# Puzzle 19: Count Numbers (Meandering Numbers)

One more GP practice puzzle.

Rules Place a number in each cell. The numbers within an area go from 1 to the size of that area, with consecutive numbers horizontally or vertically adjacent. Cells with equal numbers (necessarily from different areas) must not touch, not even diagonally.

Or see the instruction booklet.

# Puzzle 17: Box of 2 or 3

Here’s a small practice puzzle for one of the new (to me) types at next weekend’s Japanese round of the puzzle GP.

Rules Group some circles into boxes, such that each box contains two or three circles, such that all circles within a box are connected by edges within that box, and such that edges don’t connect circles that belong to different boxes of the same size. Furthermore, all black circles must be boxed.