These puzzles from the World Sudoku and Puzzle Championship 2022
held in Krakow, Poland are freely available to the public.
You can download them, send them to your friends, or share your
solving experience online. Please mention that these are puzzles
from the WSPC, which was organized by the Polish puzzle
association SFINKS and held under the auspices of the World
Puzzle Federation. Also, share the WPF logo, and do not forget
to share the name or nickname of the author properly.
If you are a publisher and are interested in republishing the
puzzles, you must still contact your national representative for
more details. The contacts can be found on the WPF website in
the Members section.
– WPF –
PUZZLE
ROUND 16
16.1 Akari Sam Cappleman-Lynes
Place lights in some cells so that every cell is illuminated. Lights illuminate the cell they’re in as well as all cells seen in a
straight line horizontally or vertically, not obstructed by a black cell. Lights may not illuminate each other. Clues represent
the number of lights in the (up to) four cells surrounding the clue.
1
1 1
1 1
2
16.2 Aqre Eric Fox
Shade some cells so that all shaded cells form one orthogonally connected area. Regions with numbers must contain the
indicated amount of shaded cells. There may not exist a run of more than three consecutive shaded or unshaded cells
horizontally or vertically anywhere in the grid.
5 15
3
16.3 Magnets Sam Cappleman-Lynes
Place pluses and minuses into some cells such that the numbers outside the grid equate to how many of the indicated
symbol appear in the corresponding row or column. An outlined domino either contains no pluses and no minuses, or one
cell with a plus and one cell with a minus. No two symbols of the same type may appear in orthogonally adjacent cells.
+ 2 2
- 3 0
2
3
0 2
1
2
4
16.4 Compass Sam Cappleman-Lynes
Divide the grid into regions of orthogonally connected cells, each containing exactly one compass. A number in a
compass indicates how many cells belong to its region that are further in the indicated direction than the compass itself.
9
63 6
5
16.5 Square Jam Eric Fox
Divide the grid into square regions of orthogonally connected cells. A number indicates the side length of the square it’s
in. Region borders may not form any four-way intersections.
4 4
1 1
6
16.6 Fillomino Martin Ender
Divide the grid into regions of orthogonally connected cells. Two regions of the same size may not share an edge. Clued
cells must belong to a region containing the indicated number of cells.
1 4
2 6 8
2 4
8 1 3
1 3
6 6 2
8 6
7
16.7 Battleships JinHoo Ahn
Place the given fleet of ships into the grid so that no two ships are touching, not even diagonally. Rotating ships is
permitted. A clue outside the grid indicates the number of cells in the corresponding row or column that are occupied by
ships. Cells with waves cannot be occupied by a ship. A given ship segment must be used as the part of a ship that its
shape represents.
1
1
1
1
～
～ 2
～
2
2
3
3
4
1 1 2 1 2 3 1 2 3 4
8
16.8 Criss-Cross JinHoo Ahn
Enter the given words in the grid, one character per cell, to complete the crisscross pattern. Each word is used exactly
once, and will either read left-to-right or top-to-bottom.
AND AR T ASK DAD
EA T I LL I NK I NN
LIT NE T NUN PE T
PIN SEA SKY SPY
TIN TIP URN YAK
9
16.9 Pentominous JinHoo Ahn
Divide the grid into regions of five orthogonally connected cells so that no two regions of the same shape share an edge,
counting rotations and reflections as the same. Clued cells must belong to a region with the pentomino shape associated
with that letter.
X V
Z L
T
Y
W P
U F
10
16.10 Nanro JinHoo Ahn
Label some cells with numbers to form a single connected group of labeled cells; no 2×2 group of cells may be fully
labeled. Each bold region must contain at least one labeled cell. Each number (including any given numbers) must equal
the total count of labeled cells in that region. When two numbers are orthogonally adjacent across a region boundary, the
numbers must be different.
2 3 2 3
3 2 3 2
2 3 2 3
3 2 3 2
11
16.11 Disorderly Loop (Full) JinHoo Ahn
Draw a non-intersecting loop through the centers of all empty cells. Clued cells may not be used by the loop. Clues
represent the lengths of the next N line segments appearing in the loop, not necessarily in order, starting with a line in the
cell adjacent to the clue in the direction of its arrow and moving in the direction of the arrow, where N is the amount of
numbers in the clue.
1
3
1
1
1 1
2
1 1
1
2 2
2
1 1
1
1
2
1
2
12
16.12 Country Road JinHoo Ahn
Draw a single, non-intersecting loop in the grid that enters and exits each bold region exactly once. If a number clue is
given in a region, that number indicates the exact number of cells used by the loop in the region. Unused cells cannot be
orthogonally adjacent across different regions.
1 4 1
13