Logic Puzzles booklet #4 1999-2000 Tim Peeters (http://www.home.zonnet.

nl/kostunix/)

Magic Square #1 (***)

In every row, every column and on the two diagonals every number from 1 to 9 appears exactly once.
Some numbers are already given, can you complete the square?

Magic Square #2 (***)

Fill in the numbers 1 to 9. In every row, column and 3 by 3 square the numbers 1 to 9 may only appear
once.

2 3

4
6

6
5

1
7

9
3

3
6

1 5
8
2
9

1
3
2
6

1 8

Logic Puzzles booklet #4 1999-2000 Tim Peeters (http://www.home.zonnet.nl/kostunix/)

Scheduling #1 (**)
Eight teams want to join a competition. They want to play each other during 7 play rounds. Every
team plays exactly once every round. After the 7 rounds each team has played against every other
team. Some of the games and home playing teams are already given. The order of the games in a
round doesn't matter. Also the number of home matches isn't relevant for this problem. Can you
reconstruct the schedule?

Round 1 Round 2 Round 3 Round 4 Round 5 Round 6 Round 7

Game 1
7-5
47-1
3-8
8-1
24-3
Game 2
6-8
86-2
33Game 3
577Game 4
6-

Scheduling #2 (***)
Eight teams want to play a tournament, each playing seven rounds, seven different opponents and
seven different sports. Can you complete the schedule below so that each team plays every opponent,
round and game exactly once? An 'X' indicates that the sport in question is not played in that round.
The order of the teams is of no relevance.

Round 1 Round 2 Round 3 Round 4 Round 5 Round 6 Round 7

Am. Football
2-8
13-7
Baseball
18Basketball
64-8
Dodge ball
21Ice hockey
X
4Soccer
63Volleyball
5-3
48-

Dividing Land (**)

These 36 pieces of land must be divided between three new owners. All pieces measure exactly 4
square miles. The numbers on the left and above the map indicate the number of square miles that are
owned by Mr. , Mr. or Mr. in that row or column. Can you find out who owns what by coloring
the map?

Logic Puzzles booklet #4 1999-2000 Tim Peeters (http://www.home.zonnet.nl/kostunix/)

Hexagonal ABCD-game (***)

In all rows the characters A, B, C and D are written once in a cell. The characters by the arrows give
you the first character that is seen in that row. 25 cells stay empty.

Hexagonal Number Crossword (**)

Fill in the numbers 1 to 9 in the diagram below according to the following rules. The numbers give
you the sum of all the numbers in that (piece of) row. All numbers in each (piece of) row must be
different.

Logic Puzzles booklet #4 1999-2000 Tim Peeters (http://www.home.zonnet.nl/kostunix/)

Cattle (**)
Four farmers each have a part of land. All four have five cows which graze on their land. All the cows
need some space to graze. The cells the cows graze in do not touch, not even diagonally, even when
there is a fence separating the cows. Two cows are already given, can you find the other 18?

Fitting Strings (****)

Place the 11 strings below in the empty diagram. The numbers indicate how many spaces are filled by
characters. The character 'X' must appear in every row and column exactly once. All strings must be
attached to each other through itself or other words, as in SCRABBLE. How are the strings placed?

DIOXINE
EXPRES

INDEX
LUXE

LUXOR
LYNX

MIXER
OXFORD

REX
TEMPEX

8 2 6 6 4 8 3 4 7 1
3
6
3
7
7
3
4
7
3
6

XYLOFOON

Logic Puzzles booklet #4 1999-2000 Tim Peeters (http://www.home.zonnet.nl/kostunix/)

Skyscrapers variation (*, ** & ***)

Next 3 puzzles are skyscraper puzzles, the only difference between these and regular skyscrapers are
that in these puzzles there could be blanks. The rules of a skyscraper puzzle are as follows: In every
row and column skyscrapers are built with each a different height. The numbers around the map tell
you the sum of the heights of the skyscrapers you can see when looking from that side. You can see a
skyscraper only when all the skyscrapers in front are smaller. All possible heights are used exactly
once in every row and column. 1~4 indicates that only heights 1, 2, 3 and 4 are used on that map. Can
you place the buildings on these maps?

(1~5)

(1~4)

(1~4)

Logic Puzzles booklet #4 1999-2000 Tim Peeters (http://www.home.zonnet.nl/kostunix/)

Shortest Paths (**)

Below is a map of 7 cities (A - G). All these cities are somehow connected to each other by roads. The
table below gives you the shortest paths between some of the cities using the drawn roads. All roads
have a different length between 1 and 10 miles. Can you assign the lengths to the roads?

A B C D E F
12 14 11
G 7
5
F 8
7 4
E
8
D 11
C 9
B

Constructing Roads (*)

8 cities (the circles) want to be connected to each other by roads. The number of roads reaching a city
is given in the circles. For all citizens in the cities it must be possible to travel by road to one of the
other cities. Roads can never cross and are straight lines between the two cities it connects. How are
the roads placed?