WPC French Qualification

June 10th, 2007 Booklet

Timetable
Round
Round
Round
Round
Round

1
2
3
4

Beginning
10.30
14.30
15.30
16.50

End
12.30
15.15
16.30
18.20

Maximum points
1200 points
450 points
600 points
900 points

In all rounds, a candidate who has solved correctly all problems before the end
of the round will be credited 5 points for each full minute remaining.

1
1.1

Round 1 120 minutes 1200 points

Half Dominoes

40+60 points

Put the nine half dominoes into each puzzle grid in such a way that the sum of the
number of dots in the rows, columns and diagonals is equal to the clues outside the
grid. The pieces may not be rotated or mirrored.

1.2

Fences

30+40 points

Draw a single continuous loop in each grid by connecting neighboring dots horizontally or vertically (but not diagonally). A numbered square indicates exactly how
many of its four edges are used in the loop.

1.3

Hiroimono

40+60 points

Beginning at the circled square numbered 1, enter consecutive numbers into all vacant circled squares, moving inside the diagram according to the following rules:
between two consecutive numbers, you must move in a straight line either horizontally or vertically along the edges of the diagram; you can change directions after
entering a number, but you cannot make a U-turn; you must enter numbers in all
the vacant intersections that you encounter.

1.4

Domino Hunt

180 points

A complete domino set (55 dominos from 0-0 to 9-9) has been placed in the grid.
The sides of the dominoes have been erased and the spots have been replaced by
numbers. Draw the edges of the dominoes.

1.5

Star Battle

40+70+120 points

Place two stars, the size of one square, in each column, each row, and each blackedged region of each grid. The stars do not touch each other, not even diagonally.
The black squares do not contain a star.

1.6

Minesweeper

40+50 points

There are 27 mines in each diagram, at most one in a given square. The numbers
inside the diagram indicate the number of mines that can be found on the squares
immediately adjacent to that square (horizontally, vertically, or diagonally). Squares
with a number do not contain mines.

1.7

Forbidden path

20+20+20 points

Draw a single closed loop in each grid, crossing each square exactly once. The
loop runs either horizontally or vertically and must not intersect or overlap itself
anywhere. The path must not go through any X.
2

1.8

Tents

40+50+50 points

Locate the tents in the three grids. Each tree (symbolized by T in the diagram) is
connected to exactly one tent, found in a horizontally or vertically adjacent square.
Tents do not touch each other, not even diagonally. The numbers outside the grid
reveal the total number of tents in the corresponding row or column.

1.9

Sum Skyscrapers

20+20+40 points

Each grid symbolizes a group of skyscrapers. Each row and column contains skyscrapers of different heights (1-5) (1-6 in the third puzzle). The numbers outside the grid
indicate the sum of the visible skyscrapers from that direction (a building located
behind a taller one in the same row is completely hidden).

1.10

H2O

10+20+20 points

There are water molecules composed of two H (hydrogens) and one O (oxygen) in
each grid. The O shall be next (horizontally or vertically) to each H. Locate the
position of the O, given that no two Os can touch each other, not even diagonally.

1.11

No Four in a Row

20+40+40 points

Fill in each grid with O and X so that four consecutive identical letters never appear
in any row, column, or diagonal.

2
2.1

Round 2 45 minutes 450 points

Alternate Corners

35 points

Draw a continuous loop in such a way that every second corner point should be in a
square containing a circle. The loop crosses each square exactly once and must not
intersect or overlap itself anywhere. The loop must turn when it passes through a
square containing a circle.
Translate the contents of the squares a, b, c, and d, into figures as shown. They
will be used in Problem 6.

2.2

All Alone

35 points

Black out some of the numbers in the grid so that each row and each column contains
only different digits. Black squares must not touch horizontally or vertically, and
the remaining squares must all be connected to each other.
3

Translate the contents of the squares f , g, h, and i as: black squares encode
black squares whereas non-black squares encore white squares. They will be used in
Problem 6.
f

2.3

Mirrors

35 points

Place ten diagonal two-faced mirrors (each the size of a square) in each grid, in such a way
that the trajectory of a ray of light emitted straight into the diagram from anywhere on
its boundary passes through a number of squares equal to the given value.
Translate the contents of the squares k, m, and n as: mirrors encode a black square,
whereas empty squares encode white squares. They will be used in Problem 6.
k

2.4

Rectangles

35 points

Divide the grid into rectangles so that each rectangle contains exactly one number, and
so that each number represents the number of squares of its corresponding rectangle.
Complete the data with the values found in the previous problem.
Translate the contents of the squares p, q, r, and s as: squares belonging to even-sized
rectangles encode white squares whereas squares belonging to odd-sized rectangles encore
black squares. They will be used in Problem 6.
p

2.5

Museum

35 points

The floor indicated by a grid is divided in rooms, all interconnected by doors. Some doors
are open, the others are closed. Each room displays a number which indicates how many
rooms (including itself) can be seen from it. Draw the closed doors.
Translate the contents of squares u, x, and y as: cells with an even number of walls
next to it encode a white square, whereas celles with an odd number of walls encode black
squares. They will be used in Problem 6.
u

2.6

Black and White

55 points

Fill each square with either a black or a white circle. All the squares containing black
circles must be connected to each other horizontally or vertically. Similarly, all the squares
containing white circles must be connected to each other horizontally or vertically. No 2x2
region can contain four circles of the same colour.
Complete the data with the eighteen squares coming from the previous problems.
A is the number of white squares in the fourth row, B is the number of white squares
in the third column, and C is the number of white squares in the fifth column.

A (4th row)

2.7

B (3rd col)

C (5th col)

Minesweeper

60 points

There are 18 mines in the diagram, at most one in a given square. The numbers inside
the diagram indicate the number of mines that can be found on the squares immediately
adjacent to that square (horizontally, vertically, or diagonally). Squares with a number do
not contain mines.
Complete the data with the values found in the previous problem.
X is the number of mines of the first row, Y is the number of mines of the third
column, and Z is the number of mines of the fourth column.
X (1st row)

2.8

Y (3rd col)

Z (4th col)

Easy as 1234

80 points

Place the digits 1, 2, 3, and 4 in the grid so that in every horizontal and vertical line, each
digit appear exactly once. The digits outside the grid indicate the first digit seen from
that direction.
Complete with the data coming from the previous problem.
The values of , , and are given by the values that should be in the corresponding
squares.

2.9

Skyscrapers

80 points

Each grid symbolizes a group of skyscrapers. Each row and column contains skyscrapers
of different heights (1-6). The numbers outside the grid indicate how many skyscrapers
are visible from that direction (a building located behind a taller one in the same row is
completely hidden).
Complete with the data coming from the previous problem.

Round 3 Innovative

See the other booklet file.

Round 4 Difficult Innovative

See the other booklet file.