Deviously Difficult Mind-Bending Puzzles
Deviously Difficult Mind-Bending Puzzles
PUZZLES/GAMES
Can. $14.95
$9.95
^B
Sharpen your pencil and get
w
started on the tricky puzzles inside.
^
\,
ISBN l-4D27-lfllD-
78'\<*02»7-\8'\06i
Ne1
IVAN MOSCOVICH
Deviously
Difficult
Mind-Bending
Puzzles
Sterling Pill
Deviously Difficult Mind-Bending Puzzles
Was commissioned, edited, designed, and produced by
Imagine Puzzles Ltd.,
20 Lochaline Street
London W6 9SH
United Kingdom
Printed in China
All rights reserved
Chapter 1
Get in line 8
Chapter 2
Triangles 18
Chapter 3
Getting from A to B 22
Chapter 4
Dissections 32
Chapter 5
Packing 'em in 40
Chapter 6
Jigsaws 46
Chapter 7
Magic squares 54
Chapter 8
Any which way 58
Chapter 9
Make your move 68
Chapter 10
Weird geometry 74
Chapter 11
Map madness so
Chapter 12
Mazes 86
Answers 88
CutOUtS 99
PREFACE
I have been designing and inventing puzzles, games, and toys
for the past 30 years or so. During that period I also
conceived and created a science museum with, among other
things, a planetarium. Today I devote all my time to the
creation of games and toys — and enjoy every moment of it.
Many of the games and puzzles in this book are completely original;
others are novel adaptations of more traditional games. My hope is that
this book will convey my enthusiasm for and fascination with games and
my approach to their creation and design. It combines entertainment
with an intellectual challenge, through which a great number of concepts
basic to art, science, and mathematics may be tackled.
This is an open-ended book; there are many opportunities for readers
to modify games in their own way, and to invent new variations. I hope
that this will cause a chain reaction: You will play the games, try to solve
the problems, and be stimulated to create your own rules and designs,
your own games, puzzles, and esthetically pleasing structures.
Despite the diversity of topics included here, there is an underlying
continuity in these puzzles: an interplay between geometry and
combinatorics (the different ways in which objects can be arranged). All
the games and puzzles are designed so that they can easily be made and
solved by the average enthusiast. They do not require special skills or
materials, most require only cardboard and paint. Some puzzles are best
solved through trial and error, so the Cut-outs section on pages 99-127
has pieces you can use for some of the puzzles. Color is important, and
the many colored illustrations depict examples not just of games, but of
the beautiful designs and patterns that arise out of them.
These are not just numerically inspired visual patterns. They can excite
the mind and suggest new ideas and insights, new modes of thought,
and creative expression. In fact, the creation of such compositions may
become for you an exciting activity in its own right.
The topics I have selected are biased toward visual geometrical
concepts, with a strong emphasis on structure and pattern, rather than
numerical concepts and word games. This bias is, of course, intended. I
have always been fascinated by the interaction of geometry and
combinatorics, two powerful disciplines that can lead to so many
surprising discoveries and complexities, all by taking a small number of
basic elements as building blocks and using them according to simple rules.
The book is designed so that each item stands alone (even
if it is in fact related to others), so you can dip in at will without the
frustration of cross-referencing. I hope you enjoy Deviously Difficult
Mind-Bending Puzzles as much as I have enjoyed creating it for you.
IVAN MOSCOVICH
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES 5
PROBLEAA SOLVING AND CREATIVITY
ANSWER page 88
6 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
PROBLEAA SOLVING AND CREATIVITY
ANSWER page 88
ANSWER page 88
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES 7
PROBLEM SOLVING AND CREATIVITY
From X to Y
Speed demon
Replace X and Y with different letters so that Pakistani pace bowler Shoaib Akhtar became the
these statements are correct: first man to bowl a cricket ball at 100 miles per
hour. How can the average person propel
OOOVO
10X something at this speed without using any
20X =
equipment?
30X / /
e h a t
right hand. If I select gloves at random,
what is the least number
of rubber gloves that
d u Ie
I need to pick in order
to have a usable pair?
HOW TO CREATE
A STRAIGHT LINE
A By the ancient rope-stretching
method — stretching a thread or rope
between two points
B By folding a piece of paper
7 1
Flexible linkages
On the far right is a representation of a Who was. ..Euclid?
dodecahedron (a 12-sided solid) made from He was a Greek mathematician born
30 flexible links. Note how three links join at around 300 BC. He is well known for
any one point. Because the links are flexible, his work Elements, a comprehensive
the figure can be moved around to create 13-volume treatise on many aspects
a remarkable variety of forms: a cylinder, a of mathematics with an emphasis on
star, a ten-sided polygon (decagon), and geometry.
an object resembling a flying saucer. Much It is unclear whether he discovered
of the beauty of the original regular shape is everything contained in the work
retained by these distortions, and the extra himself or reorganized the work
lack of regularity and familiarity can arouse of other mathematicians.
our interest. Other geometrical forms can be Nevertheless, modern versions of
built from links and subjected to distortions, Euclid's Elements are still used in
with equally intriguing results. some schools and universities
today — more than 2200 years after
they were originally written.
THE DODECAHEDRON
This is one of the regular (Euclidean)
solids. The others are the tetrahedron,
cube, octahedron, and the
icosahedron.
1 O DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
THE GREAT DIVIDE
7
Farmer Giles was looking
to see how best to divide
Did you know...
up his square field for the The "divided by" symbol first
coming season. He can grow appeared in print in 1659,
a different crop in each but it was used by the i
fenced-off area. Due to Scandinavians as a subtraction
draconian planning sign. The two dots above and below
regulations, any fences he the horizontal line represent the
erects must run in a straight numerator and denominator.
line across the full length of
the field. He wondered how
many types of crops he
would be able to grow and,
being an inquisitive
countryman with nothing
better to do, he decided to
find out...
Rural areas
The farmer found that his field
divides neatly into two regions
using one straight fence. A second
fence can divide each of these
regions into two again, giving a
total of four regions, so he will be
able to grow four crops.
Can a third fence divide all four of
these parts in two? If so, there
would be eight regions formed by
three lines. But in fact there are
only seven: The third line can be
made to pass through three of the
previous four regions, but it
cannot encounter all of them. As a
result, only seven areas can be
formed by building three fences.
7
A Farmer Giles wondered how c Can you guess a general rule
many regions at most could be for the number of regions formed
Did you know...
formed by four straight fences by a given number of fences?
The "forward slash"
across the field. What do you D Finally, can you put your rule sometimes used for
think? into the form of a formula? divisions and, more
B How many different crops recently, in World
could the farmer grow if he had ANSWER page 88 Wide Web (Internet)
five fences? addresses, is called
a virgule.
GET IN LINE 11
THE GREAT DIVIDE
De-fence-less
Farmer Gill, who lived down the lane from Giles,
ANSWER page 89
Pizza palaver
How can you cut a circular pizza
into eight pieces using three
straight cuts of a knife? Each
piece must have the same
amount of topping and crust.
ANSWER page 89
ANSWER page 89
1 2 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
LINE AAEET5 LINE
Weld done
Jemma wanted to put fancy strips of leading onto Jemma wondered what the general solution was.
her square window. The thin strips of lead had to be In other words, what is the largest number of welds
kept straight, and whenever two strips overlapped required if she used n strips, with each strip oriented
she had to weld them together. It stands to reason in a unique direction? Here's a hint: To get the
that any two strips, if not parallel, had to meet in maximum number of welds, each strip has to cross all
exactly one weld point — the intersection. Similarly, the others. Can this always be arranged?
three strips of lead required three welds at most and,
in the worst case scenario, four strips needed six welds. ANSWER page 89
GET IN LINE 13
LINE MEETS LINE
Art Deco-ration
Jemma decided on an Art Deco
design to paint onto her wall.
She used a ruler and pen to
draw just seven straight lines
(she didn't want to tire out her
creativity too quickly).
Wherever a triangle had
formed, she painted that area
red. As you can see, her
chosen design formed six
triangles. Could you have
done better?
ANSWER page 89
Gone to pot
Jemma had just about finished her
room when, to her horror, she
realized that her Feng Shui was all
awry. Her ten plant pots were all
over the place, sending her karma
straight out of the window. She
found a pleasant arrangement
(illustrated) in which the ten plant
pots lay on just five different lines.
Each line contains four plant pots.
Can you find at least one other
solution, completely different in
appearance from this one, that
satisfies the same criteria?
ANSWER page 89
■
Nine areas
MI7 would like B3RT to travel
through the nine suspect areas
shown. However, time constraints
limit B3RT to changing his route
only by rotating on the spot on
three occasions at most. (This
would be equivalent to drawing
four straight lines through the
dots without lifting your pencil.)
B3RT can, however, start and
finish wherever he likes.
Can you see the route that B3RT
should take?
ANSWER page 89
Sneaky solution
Can you see a clever way of solving the Nine areas
puzzle by changing B3RT's route just twice? In other
words, by drawing three continuous straight lines
instead of four?
ANSWER page 89
GET IN LINE 15
THROUGH THE AAIDDLE
Twelve areas
MI7 was planning big things for
B3RT. Suppose he took on a larger
mission in which he would have
to investigate the 12 areas shown.
Starting and finishing at any point,
what is the fewest number of
continuous straight lines needed
to travel through the exact center
of every area?
ANSWER page 89
Sixteen areas
Now suppose B3RT has to travel through the center of these 16 areas
using six continuous lines. Because MI7 is afraid of losing B3RT
in such a large area, they want him to return to wherever he started
from — in other words, the route forms a closed loop. Can you find
such a solution?
ANSWER page 89
1 6 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
EULER'S PROBLEAA
ANSWER page 90
?
What is... topology?
Topology is the branch of
mathematics that looks at
the fundamental
connectedness of objects.
For example, the world-
famous map of the
London Underground
bears no relation to the
actual routes that the
trains take. The tunnels are
far more wiggly and the
scale is deceptive.
However, the map captures
the essential nature of how
the tracks connect. In the
case of the bridges of
Konigsberg, we can
represent the real situation
topologically using
diagrams such as those
illustrated here.
GET IN LINE 17
EULER'S PROBLEM
7
At a stroke
Misha's library book tells the story of the Konigsberg Did you know...
bridge legend. However, something caught his eye
Any political map — that is, a map in
immediately On the inside cover of the book Misha which no bordering countries share
noticed four differently shaped stamps, presumably the same color — can be completed
used to indicate which librarian lent that particular using just four colors. In 1976,
book. He tried tracing each figure without lifting his mathematicians Kenneth Appel and
pencil from the paper, drawing each line once only. Wolfgang Haken proved that four
He found that some diagrams were impossible — colors are sufficient no matter how
which ones? Can you give Misha a general rule to large or complex the map. It was the
help him identify which diagrams can be traversed in first major proof that required the
this way? use of a computer because there
were 1,482 essentially different sub-
HINT Odd numbers
maps to consider. It took 50 days of
computations to arrive at the result.
ANSWER page 90
•
He was a Swiss mathematician who one of the seemingly impossible diagrams from
lived from 1707 to 1783 and wrote the At a stroke puzzle without taking your pencil
off the paper?
up more mathematical research
than anyone else in history. He
ANSWER page 90
popularized the use of the Greek
letter pi (n) to represent the ratio
between a circle's circumference
and its diameter. He had an
excellent memory and so was able
to keep working even though he
became completely blind in later
life. His party trick was said to have
been reciting Virgil's entire Aeneid
from memory.
h
1 8 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
TWIST AND TURN
7
z Originally, computers generated graphics by drawing small dots
called pixels (picture elements) arranged in rows and columns.
< Did you know.
S
This technique is called raster graphics. The -gon ending
The majority of computer games these days use 3-D graphics of the word
to create startlingly realistic worlds and animated characters.
"polygon" comes
Believe it or not, most of these worlds are created using the from the
word Greek
gony,
humble triangle. So whether you're swooning over Lara Croft or
admiring Super Mario's mustache, you're actually looking at meaning knee.
millions of tiny triangles. Round shapes such as circles are created
by drawing lots and lots of thin triangles together. This technique
is called vector graphics.
To move these triangles around the screen, the computer
needs to transform them in three dimensions. Among the
possible types of transformations, the important ones are the
rigid motions or isometries, which move figures but do not
change their shape or size. (The name is from the Greek: isos,
the same; and metros, measure.)
Child's play
Little did Charlie know that his baby brother, Angus, eight shapes, can you work out how many ways
had already got the hang of isometries. On his Fancy there are of fitting the kiddie blocks into the holes
Games activity set were nine holes through which on the right?
nine corresponding building blocks could be placed.
For instance, Angus noticed that there were two HINT They are in a logical order.
different ways in which the isosceles triangle (shape
2) could be posted through the hole. For the other ANSWER page 90
\ -
\
-~S 7 *V~I \
7
Missing length
Did you know... Two sides of an isosceles triangle (shape 2 above)
A Playstation 2 can process around are 4 and 9 units long. What is the length of the
66 million different triangles in third side?
three-dimensional space every single
second. As well as determining the ANSWER page 90
ANSWER page 90
20 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
DO NOT EAT BEANS
ANSWER page 90
Pythagorean puzzle
Here's a simple jigsaw puzzle you can do by
re-creating these six shapes on cardboard or
paper (see cut-out on page 99).
ANSWER page 90
h
GRAPH-ICAL ANALYSIS
<
i- designs she could create...
u. a branch of mathematics called graph theory. These pieces have a pleasingly symmetrical design,
A graph describes a system of dots (vertices even though they take longer to make.
0 or nodes) connected by lines (edges). Two The illustrations show how many wires are needed
0
many real-life problems. For example, a
IAM
novelist might write a book from start to
finish, similar to a graph called a path.
A farmer has an ongoing routine of jobs to
do throughout the year, like the cycle graph.
A toy that has several parts that must be
made before the whole toy is assembled is ANSWER page 90
similar to a star or, if the assembly requires
several stages, a tree. And a business meeting
might look like a wheel — everyone interacts Runes
with everyone else. By analyzing a graph, the Janice makes beautiful runes that have a line design
most efficient ordering of tasks for a drawn on them. The designs are created by joining
particular situation may be deduced. every clasp on the perimeter with two other clasps
Path Tree Wheel to form one continuous loop. The diagrams show
,
Star
y
Cycle that with three clasps only one design is possible.
With four clasps, three designs are possible — two
, A A
of these appear similar but are not identical because
■
a they look different when hung from the main clasp.
How many designs would be possible with five
, M X YX
. AV 0 T * *
ANSWER page 90
GETTING FROM A TO B 23
GRAPH-ICAL ANALYSIS
How to play
Galaxy game
This puzzle game is based on an original design The aim is to visit all the planets of the galaxy (the
by the 19th-century Irish mathematician circles) in one continuous trip. Place the 1 counter
William Rowan Hamilton. on any circle you like. This is your home planet. Now
fly to any adjoining planet and place the 2 counter
Setup there. Continue around the galaxy, placing the disks
You can play this game by writing the numbers in in strict number order from 1 to 20. The aim of the
game is to visit every planet once, but you must
pencil, but it's best if you cut out the 20 disks
numbered from 1 to 20 (see cutout on page 99). return to your home planet at the end of the trip!
answer page 90
©@®©
©©©®®®©®@©©©©®©®
24 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
VERY TWO-DIMENSIONAL
7
There's much cutthroat competition among
the utility industries in Smallville. Given Did you know...
that pipelines and wires sometimes have to Although our utility graph has only
share the same holes in the ground, sabotage two dimensions, and everyday life
and industrial espionage cannot be has three dimensions, some
eliminated. Here we look at the problems scientists believe that the universe
created if each company wishes to stay well may have as many as ten
away from the others... dimensions? This idea, called the
superstring theory, is the best
The utilities problem candidate for a theory that binds
If a network of connections can be drawn on a 2-D the entire universe together. In this
plane without any lines crossing (other than at a theory, everything in the universe
node or junction), then it is said to be planar. For consists of fantastically small
example, the graph formed by the components of an strings, which are vibrating and
electrical circuit on one side of a printed circuit board spinning in a ten-dimensional space
must be planar to avoid short circuits. The strings are so small that
In this problem, each house in Smallville wants 100,000,000,000,000,000,000 of
to receive gas, water, and electricity. However, each them laid end to end would equal
company is adamant that its pipes and wires cannot the diameter of one proton.
cross over any from a rival utility. Can you connect
each house with each utility in such a way that no
lines intersect (in other words, form a planar graph)?
It can be done.
ANSWER page 91
Gas
o
Water
o
Electricity
GETTING FROM A TO B 25
VERY TWO-DIMENSIONAL
Rules
a No line may cross any other line (that is, the graph
must be planar).
b No node (junction) can have more than three lines
connecting to it. You can put a circle around any dot
connected by three lines to help you avoid it.
Advanced game
Outcome
Once you've got the hang of the simple
The loser is the first player who finds it impossible version, try starting the game with three or
to make a valid move. four unconnected dots.
Off to work we go
Workers from the electricity, gas, water,
and telephone companies need to get to
their corresponding offices. However, so
suspicious are they of their rivals that they
will not even cross the path taken by any
of the other employees. Can you lead
i
each employee to the correct office
without any of their paths crossing?
Upsizing
Suppose, instead, there were six workers
i
trying to get to six offices. Would the
problem still be solvable?
ANSWERS page 91
26 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
ROADS AND TREES
The council of the small island of Fifetons schemes they have to consider. They could be
is in disarray. None of the counselors can here all week. Thankfully, help is close at
hand...
n
agree on how many essentially different road
Ground plan o o
A counselor from the nearby island of Fawrtons had
come along to Fifetons' planning meeting. "We drew
out all the essentially different possibilities," explained 6 6
the counselor. "Each one had a unique way of
connecting up the roads, no matter how the roads
were laid out in real life. We found there were 16
ways of connecting together four towns using just
three roads. Although you have five towns, to be
connected with four roads, that should help." Indeed
it did. Can you work out how many essentially
different plans the Roads Committee of Fifetons will
have to consider?
7
Lang time, no see
On the nearby Lang Island, there are also four towns Did you know...
but they are spaced farther apart, as shown. The The problem of visiting all four
position of each town is accurate. The previous road towns in the shortest possible
system was scrapped, and it is currently not possible ■ distance is called The Traveling
for anyone to travel anywhere safely. What Salesman Problem. It is not
arrangement of roads will allow access to every town straightforward to work out the
and yet use the shortest total length of road? shortest route to take. Imagine this
with more towns and roads, and the
HINT The roads can cross and form junctions if you wish. calculations rapidly increase. If a
salesman had a 50-city itinerary,
ANSWER page 91 even a fast computer would take
1 ,000,000,000,000,000,000,000,
000,000,000,000,000 times the age
of the universe to calculate the best
route. This kind of puzzle, in which
the possibilities increase rapidly
when the problem gets only slightly
more complex, is known as a non-
deterministic polynomial (NP)
problem.
GETTING FROM A TO B 27
ROADS AND TREES
Mathematical trees
Trees are traditional symbols of life and growth.
If your choice doesn't agree with the computer's
Tree graphs occur in early attempts to represent suggestion, you can add a new question that
logical relations diagrammatically, and they were distinguishes between the character you were
known to Aristotle. Ancient and medieval
thinking of and the computer's guess. This adds
philosophers were obsessed with tree graphs. another node and branch to the tree, which means
These are still widely used to classify objects in that the tree has "learned" a new person. Over time,
hierarchical systems. For example, the classification the tree grows and increases the chance of guessing
of all living creatures is broken down into kingdoms, the right answer. Another fun thing to do is to play
which branch into phyla, genera, species, and so on. the tree again, answering the questions as you would
A related area of mathematics in which topological personally — the result tells you which sitcom
ideas arise is the theory of graphs. When nodes are character you most closely resemble.
joined by lines, what matters is not the precise
position of the lines and nodes but the way they Points Trees Points Trees
connect. A graph is connected if it is all in one •
<
piece, meaning that there is a continuous path
from any node to any other. The precise shape
of the edges is irrelevant.
If a graph contains a circuit (that is, any closed
loop of different lines), then so does any
topologically equivalent graph. Graphs that do
not contain any circuits are called trees. It is easy
to see why — the lines often branch but they
never link up again.
Many real-life processes can be represented
as trees. For example, Connect Four, the "drop
counters to get four in a row" game, has been
so thoroughly analyzed by a computer mapping
out the entire tree of possible moves that the
computer cannot lose. Chess has not been
"solved" in this way because the possible routes
multiply rapidly after just a few moves.
A binary tree, in which a maximum of two
branches occur at any node, is a basic form of
artificial intelligence. Examples of binary tree
guessing games can be found on the Internet.
For example, the computer may invite you to
think of a sitcom character. It will then ask you
a series of yes/no questions such as "Are you
thinking of a man?" and "Are you thinking of an
American character?" Depending on your answer,
the computer goes down a different branch of
the tree. At the very end of any particular path,
the computer will say which character you are
thinking of.
THE
DEVIOUSLY
GAME
DIFFICULT MIND-BENDING
OF TREES
PUZZLES
l_
The idea of topological equivalence is
t1
fundamental to many areas of modern
mathematics. This is a simple and rewarding
game for two or more players, designed to
encourage such understanding.
1
Set-up
On pages 101 and 103, you will find diagrams
_l
depicting a selection of 64 tree graphs with 3, 4, 5,
and 6 nodes, which you can cut out. If you are
playing with the Advanced rule (see below), note that CARDS FOR
I.I
each of the 16 rows contain 4 topologically equivalent PLAYING TREES
Here are four graphs
1 1
cards (i.e., their endpoints and junctions are essentially
the same except for rotations). that all have six
You will also need a set of six sticks of the same endpoints. They are
all topologically
length (such as pencils, chopsticks) to re-create the
graphs shown on the cards.
equivalent.
I
I
i i
i i
i i
Initial U
Sample move
It is the first player's turn. The five sticks are placed
in a straight line, with the sixth in reserve. The top
row shows the three cards that the first player
turned up. Note: In this example we are playing
the game without the use of the Advanced rule.
free move Player rotates the bottom stick for First move — Rotation —
card 3 taken card 1 taken Second
card 2 move
taken —
free (move type D) and wins card 1, even though
tiC
the graph is upside-down.
1
30 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
RAMSEY'S GAAAE
How to play
Some theorems about graphs with
identifiable nodes and lines were proved Two players (red and blue in this example) take
by Frank Plumpton Ramsey, so this graph- turns to color one complete line (node to node)
coloring game is named after him. Here the on the board. However, you may not draw a line
game board is a nine-node complete if it forms a closed triangle whose edges are all the
graph — that is, every node is connected to same color.
every other node. Winning
A COMPLETED CAME
The red player lost by being
forced to close a red triangle
(yellow area).
GETTING FROM A TO B 31
RAMSEY'S GAME
Who
Wl was. ..Ramsey?
*^
W The
The mathematician and philosopher Frank Plumpton
Rar
Ramsey was born in Cambridge, England, in 1903.
He read mathematics at Trinity College there, and
was only 21 years old when he was made a fellow of
King's College. He was inspired by Bertrand Russell —
another famous mathematician and philosopher, who
proved that all mathematics was logic and nothing else.
Ramsey died at the early age of 26 following surgery.
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
INGENIOUS TANGRAMS
How to make
a tangram
To make your own tangram, cut
out the top seven pieces on page
107. Now try to do some of the
puzzles on the opposite page.
DISSECTIONS 33
INGENIOUS TANGRAMS
Tangram challenges
Using the tangram pieces, try to form each of these
pictures. There are only two rules: All seven pieces
must be used, and the pieces are not allowed to
overlap. Start off with the people and animals first,
then move on to the more difficult geometric designs.
ANSWERS page 91
34 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
INGENIOUS TANGRAMS
For this puzzle, cut out the two identical sets of pieces on page
107. Take the four largest triangles and arrange them as
shown in either of the diagrams below. Now use all the
remaining pieces to complete the large square. Once you've
solved one, try the other.
ANSWER page 91
DISSECTIONS 35
ABOUT THE SQUARE
about
greatns, squares? ^IT'S A SQUARE! n>
What's Mathemsoaticia magicians, and ^ m
>
people who like puzzles and games C
get very excited about them because
they are simple and complete, but also < _
because they are shapes you can do
much with. The author Lewis Carroll's
opinion was clear: o3 EQUILATERAL!!!
A square is defined as a plane three or four short steps, with the The square is found in nature
figure with four equal sides and square as their common thread. in the crystals of many minerals,
four right (90°) angles. A square is The Pythagoreans called four, including common salt (sodium
counted as a rectangle, but is the first non-trivial square number, chloride). It has provided the
regarded as a special type. If the the number of justice, because it is proportions for famous ancient
length of the side of a square is X, the first one obtained by structures and modern buildings
then the area of the square is X to multiplying the same number and even played a role in the
the power of 2, or X squared. This together: 2 x 2 = 4. To this day, structure of the Hebrew alphabet.
is where the term for the product The square has given birth to
square means "truth." Someone
that results from multiplying who is a square shooter or is many ancient games that are still
anything by itself comes from. foursquare is a frank and honest played today: chess, Go, solitaire,
When a square is divided into person with firm convictions. dominoes — and many new games
smaller squares we obtain a matrix A square meal is good, honest that have yet to be created.
or lattice that becomes magic food, while President Theodore Try your hand at the square
when filled with numbers in Roosevelt offered his citizens activities overleaf.
special configurations. In its the Square Deal
in 1902.
lifelong partnership with the right-
angled triangle, the square has
inspired more mathematics than
most of us are aware exist. From
Pythagoras' Theorem to
Einstein's General Theory of
Relativity, and from the flat
geometry of Euclid to the
curvature of space, it is but
4 9 2
3 5 7
VARIATIONS 8 1 6
ON THE SQUARE
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
SPLITTING SQUARES
Square dissections
All these patterns can be
made by drawing a square,
then dividing the sides into
halves or thirds. They can
easily be drawn, colored,
and cut out to become
dissection puzzles (see
cut-out on page 109).
To re-create the original
squares from their parts
is often harder than you
might think...
DISSECTIONS 37
SPLITTING SQUARES
Five-piece suite
1 rectangle
This five-piece jigsaw is very versatile. To make one,
2 triangle
draw a square, then mark the point that is halfway
along each edge. Then draw a diagonal line from one 3 Swiss cross
corner to the middle of an opposite side, as shown. 4 parallelogram
Now cut out the pieces along the solid black lines in s rhomboid
the illustration to give you five pieces (or see cutout
on page 111). ANSWER page 91
In succession, rearrange the five parts to form the
five geometrical figures shown on the right.
Number jig
Squarea
Suppose the area of the overall square in the Five- Suppose you had a jigsaw consisting of 1 ,000
piece suite puzzle is 100 square units. What is the standard (interlocking) pieces. Joining one group of
area of the individual small square piece? pieces to one other group of pieces counts as one
move. Here, a group means one or more. What is the
answer page 91 fewest number of moves that it will take to connect
all 1,000 pieces? What is the greatest number of
moves required?
ANSWER page 91
1
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
REARRANGEMENTS
ANSWER page 91
answer page 91
0
♦
DISSECTIONS
REARRANGEMENTS
Stars puzzle
Copy and cut out the 24 parts of the 12-pointed star (or see cutout
on page 111). Rearrange the 24 pieces to form three identically shaped
smaller replicas of the big star.
ANSWER page 91
40 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
STORAGE ROOAA
o
z
The company supplies free cubic cardboard N = 2 K = 2 N = 3 K=2 N =4 K =2
boxes for its customers to use. Unusually, the
firm charges by the amount of floor space the
i
be square. So if you don't use all of your area,
that's tough luck. However, the length of the
square's sides does not have to be a whole
number. Incidentally, boxes cannot be stacked
on top of each other for safety reasons. N = 5 K = 2.707 = 5 K =2.828
When Ashia sent her first storage box to
FASSC, she was charged one unit. When she
had another box to send, she soon realized
that she might as well send two more because
the cost would be the same for two, three, or
four boxes (2 x 2).
When the fifth box was full, things got a bit
more complicated. Since there was no reason N = 6 K = 3 = 7 K =3
why the boxes couldn't be tilted, clever
solutions were possible. Out of the two likely
possibilities, the more efficient packing was
obtained if only the central square was tilted.
In this instance, the cost was 2.707 units
because that was the size of the smallest
square that contained all the boxes.
The next tricky decision came when the
N = 8 K =3 N =9 K = 3
amount of junk stored reached ten boxes (yes,
Ashia liked Barbie that much). No one has yet
found a better solution than the one shown,
but that doesn't mean one doesn't exist. For
the eleventh and final box, FASCC was going
to charge Ashia for 3.914 units of storage.
However, a slightly better solution was
possible...
BOXING CLEVER
N = 10 K = 3.707 N = 11 K = 3.914
How Ashia's belongings from one to eleven
boxes were packed in the warehouse. (best packing known so far) (not the minimal)
PACKING 'EM IN 41
STORAGE ROOAA
7
Boxing clever
Cut out 1 1 unit squares of exactly the dimensions Did you know...
shown below. The aim of the game is to pack all the This type of packing problem was
squares into the square warehouse below. Remember important in the days when wars were
that no square must cross the black line nor overlap won with cannon fire. By using a
any other square. It can be done! telescope to determine the packing
pattern and height of your opponents'
ANSWER page 92 pile of cannonballs, you could
determine how much ammunition
they had left.
UNIT SQUARE
42 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
PAVING THE WAY
1 2 3 4 Patio ratio
□
Suppose a customer came in to Terry's Mad Mad Mad ... shop to buy
some tiles for a square patio. The customer wants to use at least two
paving slabs. Since Terry stocks only square shapes in various sizes, as
shown below, what is the fewest number of square slabs the customer
5 6 will need to buy? In other words, what is the smallest number of squares
you can divide these squares into? We have provided grids for areas of
2 x 2 up to 13 x 13.
ANSWER page 92
7 8 9 10
11 12 13
PACKING 'EM IN 43
PAVING THE WAY
TERRY'S TILES
Some attractive designs formed from
squares only.
44 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
DRAWN, HALVED, AND QUARTERED
gridbemight
to help but doesn't have
followed.
ANSWER page 92
7 ■
Did you know...
A half and a quarter
are the only two
fractions with special
names. All the other
names (a third, fifth,
sixth, seventh...) are
the same as the
ordinal numbers.
PACKING 'EM IN 45
DRAWN, HALVED, AND QUARTERED
7
Sequestrate the siblings
Happily (or sadly, depending on how you look at it) Did you know...
Mrs. Moore gave birth to two bouncing baby boys The half-life of some radioactive
some years later. They moved to a house with rooms material is the amount of time it
that were larger and, thankfully, less esoteric in takes for its mass to decay to half its
shape. Yet even now none of the children were original value. If you were to plot a
getting on with each other. How can Mr. Moore graph of the mass over time,
divide each of these rooms into four using the it would be smooth and gradually
same conditions as the previous puzzle so that Polly, become more horizontal — this is
Molly, Tommy, and Timmy all have identical areas known as an exponential curve.
in which to play? The half-life of a radioactive
material can vary wildly — the isotope
ANSWER page 92 polonium-212 halves in under a
microsecond while uranium-236
takes 4,500,000,000 years to do
the same.
46 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
POLYCO
Polygo
This puzzle game for two or more players SCORE CARD
is based on the recognition of polygons.
Set-up ▲ ^6V A
Cut out all 24 squares on page 113. A\ Z zf>^x
Lay the tiles facedown and mix them
thoroughly. 7 \ | 7
\ \
13 cO K
z A
touching corners all having the same »"12
12 "< 13
color. The point values for the scoring 13
16
polygons are shown in the chart on
13
the right. Shapes that differ only by 14
14 15
a rotation still score.
Winning
Solo version
CP
The player with the highest total wins.
You can also play a solitaire version of the game. Can you
assemble all 24 tiles in a 6 x 4 rectangle so that all the
colors match when two tiles are adjacent?
JIGSAWS 47
POLYGO
48 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
BITS AND PIECES
Ernie Flamsteed had been working in the bit), which computers use to store data and
depot of Awkward and Sons since 1937. as such are very flexible. This is why many
Never one to be at the white hot tip of companies were using them these days to
technology, he had only just started getting store not just UPC (Universal Product Code)
the hang of ordinary bar codes when along numbers but customer details and product
came a new invention — two-dimensional descriptions, too. Admittedly, this new system
bar codes. required a more accurate form of reader.
Ernie put on his brown coat and shuffled
It stood to reason, his manager explained. off down the corridor to see what all the
Each tiny square represented a binary digit (or fuss was about...
Effl
Since each square has two in the middle of the bar codes. Luckily, Ernie knows
different possibilities that each bar code can be constructed with a set of
(turquoise and blue), there Bits pieces (see left). He could just see the edge of
are 2x2x2x2 = 16 each bar code beneath the label, so that helped.
I I.
different possibilities. Each Furthermore, the colors of adjacent 2x2 Bits pieces
possibility represents a match on all edges. Can you reassemble the bar
number, and in turn several codes so that they are valid for all 6 products,
of these squares together (see cut-out on page 115)?
can represent anything you
like — symbols, words, ANSWER page 92
pictures. . .
Make your own set of
Bits pieces (see cut-out on
BITS
page 115) then tackle the
PIECES SET
next puzzle and game.
7
The Bits pieces you made for the previous puzzle can
also be used for this engaging two-player game. Ernie Did you know...
finds it a gentle diversion when life in the depot gets What's in a standard stripey bar
too hectic for him. code? There are a pair of bars at the
left, middle, and right of the pattern
Set-up that warn the reader that a bar code
You need one set of 16 Bits tiles and the 8x8 square is imminent. A laser then reads two
board below (see page 115) such that each tile fits sets of numbers — the set on the left
exactly on four of its squares. Place the tiles face is usually the code number of the
down and mix them thoroughly. manufacturer. The second set is the
actual product number. There is also
How to play
a "check digit" — a precalculated
1 In turn, each player must take a tile and place it on number that gives the reader a 90%
the board. It must fit over exactly four of the chance of ensuring it has read the
squares on the board. bar code correctly, and that the
2 Whenever a tile is played, it must match the edges
width of the bar codes hasn't been
of any adjacent tiles already on the board, in a
tampered with.
fashion similar to dominos.
3 Tiles may be placed so that they touch only half an
edge of another tile — see the sample game below.
Winning
player wins.
Open exercise
What is the shortest possible
game you can find? That is, if a
single player plays solitaire, and
selects from the 16 tiles laid face
up, what is the smallest number of
tiles needed to block the board so
that no others can be laid?
ANSWER page 92
Hexabits
The set of hexagons shown here represent different
ways of dividing a hexagon into two-color areas.
Copy and cut out all 19 shapes (see cut-out on
page 117). The object of the game is to fit all
the hexagons onto the blank honeycomb
grid opposite so that all touching
edges match in color.
m
mm
o
HONEYCOMBS AND JIG SAWS 5i
HEXABITS
Hexabits puzzle
Place all 19 pieces on this grid. Remember to match the color of all touching edges.
ANSWER page 92
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
DIY DOAAINOES
Domino derby
To play this combination puzzle, copy out the 24 colored square
dominoes (see cut-out on page 119). These show every possible way
of coloring a square's edges using three colors. The aim of the game
is to make all the dominoes fit so that all the touching edges match.
This in itself is not too difficult. The extra twist is that the entire outer
border must be the same color.
ANSWER page 92
^^ ^r
/ X.
JIGSAWS 53
DIY DOAAINOES
Domino rally
Cut out the 24 triangular dominoes on page 119. Again, the touching
edges must match and the entire outer border of the hexagonal grid
must be the same color.
ANSWER page 92
ANSWER page 93
2
10
4 14
J
MAGIC SQUARES 55
LO-SHU AND FRIENDS
inr
two main diagonals. As a puzzle,
see if you can place the colors in a
suitable Latin square arrangement.
ANSWER page 93
Latin square
of order 6
This time, the aim of the
puzzle is to create a Latin
square of order 6. Is this
possible? Can you place
32 tiles on the board?
ANSWER page 93
nnn
□□□
ANSWER page 93
In the red
Complete this magic square so
that it contains nine consecutive
integer numbers. Seems easy, • ]
doesn't it?
ANSWER page 93
HBM^M — — — ii "' ■ ■ ■ '--■ »■» a
MAGIC SQUARES
NOT FAIR AND SQUARE
Versatile squares
Not all magic squares have to be about adding up C How could you distribute the numbers 1, 2, 3, 4,
numbers: 6, 9, 12, 18, and 36 so that, for any row, column,
A How could you distribute the whole numbers and main diagonal of three numbers, the following
from 1 to 9 inclusive in a 3 x 3 grid so that when you always gives the same result: (outer two numbers
subtract the middle number from the sum of the multiplied together) divided by (central number)?
outer two numbers in any row, column, or main
diagonal, the result is always the same? ANSWER page 93
B How could you distribute 1, 2, 3, 4, 6, 9, 12, 18,
and 36 so that the numbers in any row, column, and
main diagonal give the same product if multiplied?
A B
10
22 18
ANSWER page 93
14
20 24
2 6
8 4 16 12
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
LIFE'S A LOTTERY
I
around 14 million to 1, but where does this number
come from? There are 49 possibilities for the first ball,
48 for the second, 47 for the third, and so on until 44
for the sixth. So that's 49 x 48 x 47 x 46 x 45 x 44. But
remember that the order of the six winning balls does
z not matter. By a similar token, there are 6x5x4x3x
o 2x1 ways of arranging those balls. Dividing this
number into the original result gives 13,983,816
X different results, or permutations.
z
in this book in the answer to the Runes puzzle on page
22, where n! = n x (n - 1) x...x 3 x 2 x 1, you could
< write this as 49!/(43! x 6!).
Permutino
This game for two to four players is based on the
dominoes principle.
Set-up
You will need one set of 24 Permutino tiles. Deal the
strips to players in turn, until all have been dealt.
How to play
1 Each player chooses a color.
2 Players take turns to add a strip to the pattern on
the table. It must match the existing colors along all
edges that touch.
3 If a player cannot lay a strip he forfeits his turn.
4 When all the strips have been laid, or no player can
move, each player calculates his score.
Scoring
Any square belonging to a connected region of
squares of a player's color that contains four or more
squares counts as one point (so a four-square
connection merits four points). In the example game
shown, blue has seven points because he has a
connected region with seven squares in it. In the Number of squares
event of a tie, the player with the largest connected Color 4
8 7 6 5 Score
region wins.
4
7
■
BrrnR
HBHE
KHKHEH
HEBHHE
BOB'S SQUARE PANELS
There are six different
designs in each of
four rotations.
Window shield
Bob wants to fit all 24 of his stained glass panels into the window
frame shown on the right. The middle square cannot be used
because the Earl of Featherstonehaugh's coat of arms will go there
later. All touching squares must share matching colors, domino-
fashion. In addition, each outer edge of the window must have
a single color, and there must be a different color for each edge.
Make your own set of Bob's tiles (see cut-out on page 123) and
use the 5x5 board on page 61 . Can you satisfy Bob's demands?
ANSWER page 93
ANY WHICH WAY 61
WINDOW OF OPPORTUNITY
STAINED CLASS
WINDOW FRAME
Fit the stained glass panels
in here.
7
You'll need a set of 24 square tiles and a 5 x 5 grid.
Lay the tiles facedown and mix them up.
How to play
Did you know...
Glass is sometimes considered
1 The first player picks up a tile and places it to be a liquid. The different
anywhere on the board. Of;
■ ingredients in the glass are in
2 Players take turns playing a tile on the board.
a supercooled suspension, rather
There are two rules: The tile you play must touch than having the firm chemical bonds
at least one previously played square, and all of a usual solid. The different colors
edges of neighboring tiles must match in color. of
of glass are obtained by adding
oxides of iron (red), copper (green),
Winning oxi
or cobalt (blue).
The first player unable to place his tile loses or
the game.
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
PICTURE WINDOW
Bob Scratchitt (see pages 60-61) has If Bob can choose each color only once for
recently diversified into hexagonal pieces each hexagon, then there are 6 x 5 x 4 = 120
of glass. By good fortune more than skill raw combinations. However, a piece of glass
(by accidentally spilling a jar of metal filings), can be rotated and turned over, which reduces
he's found that certain ingredients in his glass the possibilities to the 20 different hexagons
now allow a greater range of colors — six, you see here.
to be precise.
Hexagons or cubes?
Bob has designed this window
incorrectly — his 20 hexagon
designs can't fit into the 19
available spaces shown on page
63. Can you mock up your own
set of Bob's hexagonal tiles (see
cut-out on page 125) and work
out a way for any 19 of them to
fit into the window frame? The
edges of adjacent pieces must
match colors. You'll understand
the reasoning behind the title for
this puzzle once you get going.
ANSWER page 94
DDDDD
BOB'S HEXAGONAL TILES
Bob's new range of designs and colors.
ANY WHICH WAY
PICTURE WINDOW
Window war
This game can be played with two or more players. 2 If a player places a tile in such a way that it is
adjacent to an existing piece, the touching edges
Set-up must be the same color.
You will need a set of 20 hexagonal pieces and the Winning
19-space window grid shown on this page. Lay the
tiles facedown and shuffle them. Anyone who cannot make a legal move has lost and
must drop out of the game. They should replace their
How to play unplayed tile facedown in the reserve and mix it up
1 Players take turns to pick a tile and place it with the others. Continue playing until there is only
anywhere on the board. (It does not need to be one person left — the winner.
adjacent to an existing tile.)
v/n^v/7 n □ n
ANSWER page 94
ANY WHICH WAY
DISCO DISCOLORATION
A A J^
DDIDD
DJ display
These four lighting panels will be used behind the DJ booth. This time
the sides of each square are colored using six different colors. The panels
will be laid out in different ways so that it is possible to form a
continuous zigzag line of the same color through the row of four squares
(see small schematic). This can be done for five of the six colors. For
which one of the six colors is this zigzag impossible? You may find it
helpful to copy and color in your own version (see cut-out on page 127).
ANSWER page 94
Drive time
On Monday, Stu drove from his bachelor pad at 7:30 p.m. and arrived
at the nightclub at 1 1 :00 p.m. After a wild and crazy party, he left the
nightclub on Tuesday night at 9:00 p.m. and (via a cab using the same
route) arrived back home at 11:45 p.m. What are the chances that, at
exactly the same time on Monday and Tuesday, Stu was at the same
point along the road?
ANSWER page 94
66 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
VENERABLE BEADS
dtA 888*8
designs achievable with up to five
beads are shown. Use the blank
diagram to work out how many
are possible with six beads. You
may not need to use all 15
diagrams.
ANSWER page 94
&&£:
Guess what?
How many different necklace
designs do you think Jackie could
manufacture if each necklace were
to contain a total of 20 beads in
ANSWER page 94
THE NECKLACE-COLORING
PROBLEM
ANY WHICH WAY 67
VENERABLE BEADS
Seventh heaven
Johnny, Jackie's main competitor,
sells jewelry through his web site,
veryverygoodbrooches.com. His
heptagonal designs are quite
popular. Again, each of the seven
triangles of each brooch can be
one of two possible colors. How
many brooch designs are possible
given that the brooches are
reversible (they can be turned
over)? Use the diagrams to help
you — some of them might not
be needed.
ANSWER page 94
A ▲
THE BROOCH-COLORING
PROBLEM
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
KNIGHT, KNIGHT
7
Chess has survived since the 6th
century ad, and over the years chess Did you know...
pieces have been made in many forms and Chess has hit the headlines in
materials. Originally known as Chaturanga
recent years thanks to IBM's
> (the army game), chess spread to Europe computer Deep Blue. In 1997,
On guard
Sir Prancealot of Wessex was getting anxious. Sir Prancealot's troops had gathered at the
Never the most courageous of knights, he'd strategically important location of Puddleby-on-
called all his fellow men out on a full-scale alert the-Marsh, which contains lots of arable land. His
(and on a Sunday lunchtime too) when he heard knights can occupy a square, and simultaneously
that Padrick of Cork and his ruffians were coming protect up to eight squares as if they were a
to invade. chess knight (see separate box on page 69).
a How many knights would Sir Prancealot need
if each square in a 3 x 3 square area had to
contain or be protected by at least one knight?
b How many knights would be needed to
protect a 4 x 4 area?
c How can five knights protect a 5 x 5 area?
D What about eight knights protecting
a 6 x 6 area?
e Place ten knights to guard a 7 x 7 area.
F Finally, suppose Sir Prancealot became
paranoid and wanted to cover an 8 x 8 area with
his men. Can it be done using just 12 knights?
(Use the 8 x 8 chessboard on the opposite page
if this helps.)
ANSWER page 94
MAKE YOUR MOVE 69
KNIGHTr KNIGHT
Knight tracks
Sir Prancealot's troops waited, and
waited. . .and waited some more.
7
tracks.
tBi
ANSWER page 95
moving two squares
orthogonally
immediately followed by
^■"^r^
a one-square sidestep,
as shown here.
70 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
ON TOUR
ANSWER page 95
From A to B
Suppose a knight started at one
corner of an 8 x 8 chessboard.
Would it be possible for the knight
to visit every other square and end
up at the corner opposite the start
position?
ANSWER page 95
MAKE YOUR MOVE 71
ON TOUR
ANSWER page 95
ANSWER page 95
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
CHESSBOARD STANDOFF
'No
'An,d you
whatget
'f*et out of my way," snarled the Red Queen.
Vjout of my way," snorted the White Queen.
on earth are all these other queens doing here?" The arrival of
several of the most important chess pieces on the same board
wasn't a particularly well-planned piece of diplomacy by the
Master of the Board. Clearly, some clever positioning was
going to be needed to keep the queens from attacking each
other...
Chessboard standoff
On a 4 x 4 chessboard, only four queens can
be placed so that no queen attacks another
(see black squares on diagram).
a Place five queens on a 5 x 5 board so that
no two lie in the same row, column, or any
diagonal. (Use coins or counters on the board
below to help you.)
B Now try six queens on a 6 x 6 board.
C How about seven queens on a 7 x 7
board?
D Finally, can you place eight queens on the
large 8x8 board? Once you've found one
solution, see if you can do it again so that
there are no queens on the two main
(longest) diagonals.
ANSWERS page 95
Chessboard jigsaw
Angered by her latest defeat, the Black
Queen has banished the two white corners
from the chessboard, leaving just 62 squares.
Furthermore, she has ordered her pawns to
cut up the remainder of the board into 31
individual 2x1 strips to ensure that no one
can beat her again. Can the pawns
accomplish this feat? If so, how? If not,
why not?
ANSWER page 95
MAKE YOUR MOVE
CHESSBOARD STANDOFF
ANSWERS page 96
ANSWER page 96
74 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
RIGHT THIS WAY
ANSWER page 96
Congestion calamity
This time, the cab driver is trying to
ANSWER page 96
WEIRD GEOMETRY
RIGHT THIS WAY
Hungry Horace
At the end of a hectic day, Horace the cab driver needs to drive straight
home by the shortest route (i.e., south or east at all times). But because
he is so hungry, he would like to visit a Sloppy Joe's Drive-Thru for some
sustenance along the way. Luckily there are seven branches of Sloppy
Joe's in the area. In order to avoid too much delay, he doesn't want to
drive through two SJ's. So the puzzle is: How many ways are there of
driving from his current position to home via the shortest route, going
via exactly one branch of Sloppy Joe's?
ANSWER page 96
home
Fare's fair
Suppose you started your journey
o
at point A and you wanted the
New York cab driver to take you
to point B by the shortest route
possible. In other words, the taxi
driver must always drive south or
west from every junction.
a How many ways are there of
the taxi taking you from A to B
by the most economical route
with a stopover at Central Park
(point C)?
B How many ways are there of
going from A to B by any shortest
route?
ANSWER page 97
o
NEW YORK MAP
How many different routes are there from A to B
by the shortest possible route?
WEIRD GEOMETRY 77
TAXICAB GEOMETRY
Taxicab geometry
This grid represents a large-scale map of New York. b On the grid, draw a "square" with four sides of six
Suppose a cab driver could follow only the lines (the blocks in length. Remember always to draw along
streets, never through the blocks. Are different
"streets"). We call this "taxicab geometry," because
it produces very different results from those you solutions possible?
would normally expect, as these three exercises show: c In normal 2-D geometry, it would be impossible
A In normal (Euclidean) geometry, a circle is defined to draw a triangle with sides of 14, 8, and 6 units.
as a line connecting all the points that are a fixed (Why?) Try doing it in taxicab geometry.
distance from a given point. If our taxi driver began
ANSWER page 97
in the middle of the grid, what would a "circle" with
a radius of three blocks (squares) look like? Try circles
of other radii.
OPEN EXERCISE
Cake calamity
The thermostat in Cath's fridge had given up
the ghost. So, when she came in one
Monday she found that her beautiful square,
decorated cakes had become somewhat
misshapen. In particular, the frosting had
melted badly. For each of the three cakes
pictured, can you say which one had the
original square design shown above it?
ANSWER page 97
Dough handcuffs
Cath was playing with some stretchy bread dough in
her shop. She first made a design such as the one
shown near right, which resemble some linked
handcuffs. She then played around with the dough,
deforming it but without making or filling in any
holes. She found, to her surprise, that she could
unlink the cuffs just by deforming the dough. See if
you can do the same, either with some modeling clay
or just using your mind's eye.
ANSWER page 97
7
Frosting on the cake
Cath always knew that she needed at most four Did you know...
colors of frosting to complete any of the geometric To a topologist, a donut and a
designs on her cakes. Above are three cakes that teacup with a handle are essentially
have been designed but haven't yet been frosted. the same thing because they both
Cath frosts her cakes so that no two areas sharing a have one hole. If you make a teacup
border have the same color. Can you work out the out of rubber or modeling clay,
smallest number of colors of frosting needed to cover you can gradually transform
each of these cakes completely? it into a donut without sealing
or creating any holes — this is why
ANSWER page 98 topology is sometimes called
"rubber sheet" geometry. Note that
for something to be a hole, you
must be able to thread right through
it. The bit where the tea goes is
therefore not a hole.
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
PAINTING BY NUMBERS
Modern art
Durst got out his paintbox to
start the process of coloring in
his black and white paintings.
But how many colors would
he need?
ANSWER page 98
MAP MADNESS
PAINTING BY NUAABERS
Winning
Brams' map-coloring game
This more advanced map-coloring game is named for
its inventor, Steven Brams. If the maximizer cannot play a valid move using any
of the five pens, the maximizer wins. If the entire
Set-up diagram is completed correctly (no two adjacent areas
Using a black pen, draw any map you like, such as are the same color), the minimizer wins.
the example given here. You will also need five or six
colored pens or pencils. Advanced version
Aim
ANSWER page 98
84 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
COLORING THE COLONY
ANSWER page 98
ANSWER page 98
MAP MADNESS
COLORING THE COLONY
Galactic domination
After rather too many glasses
of Port, Lord Bertram and Sir
Frederick were now fighting over
how Mars should be colonized
4 8
in the future. "The way I see it,"
snorted the lord, "is that if a
group has two separate 7
settlements on Earth, they
should also be separate on 3 9
Mars." The knight nodded 10
sagely in agreement. 6
Regions with the same number 2
must be colored the same on
Earth and on Mars. So, for
example, if you choose yellow
for 1, both the 1 areas must
be yellow. You may use a color for
more than one number, but 11
at no time may any two areas
of the same color share a border Earth
on either planet.
For example, while areas 2 and
8 are not adjacent on the map of
Earth, they cannot be given the
same color because they are
adjacent on Mars. The challenge is
to color both maps entirely using
the fewest possible colors.
ANSWER page 98
/Wars
86 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
GET LOST
Maze connections
Amazingly (sorry!), all early labyrinths
consisted of just one winding path. They
were used as a recreational or spiritual path
along which you could walk while meditating,
for instance. It is only in the past few
centuries that the concept of a puzzle maze,
with a choice of routes, has emerged.
From the mathematical standpoint, there
are only two categories of puzzle maze. The
next time you are in a life-size maze, try this
experiment. Place your hand on the left-hand
(or right-hand) wall and keep walking
forward. No matter what happens, keep
walking without letting go of the wall, and let
your hand guide you. The chances are that
this method will usually get you to the middle
but not necessarily by the shortest route. This
type of maze is described as simply
connected, because all the walls are
connected to one another.
If the maze designer is particularly sneaky,
he will use a multiply connected design.
Here, the "hand on the wall" technique
doesn't work because some of the walls
are effectively free-standing — that is, not
connected to the outer walls. Try using
the hand on the wall method on these
two mazes.
MAZE PROBLEM
Help Theseus
to escape one
more time.
•
Door to door
Who was... Daedalus?
>
I
Daedalus was imprisoned by Minos, ANSWER page 98
so to escape he made wings of wax
and feathers for himself and Icarus,
his son. Unfortunately, Icarus flew
too near the sun, his wings melted,
and he drowned in the sea.
88 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
ANSWERS
(0 bridge problem pace 5 This is how the pieces fit together correctly.
Replace X and Y with (°)C and (°)F
De-fence-less pace 11 add the fifth line, there is no reason why it Nine areas page 14
can't cross all of the previous four, and so The key to this is to do what management
m
Farmer Gill's three sizes of triangles are on for any number you choose.
shown below. consultants say they do: think outside the
The series 1 , 3, 6, 10, 15, 21 .. .is known
as triangular numbers. Can you see why? If box. If you didn't see how to solve it, you've
run head first into a conceptual block, and a
not, get some coins or counters of the same typical one: the tendency to take too narrow
size and try arranging them. The formula a view of the problem. Are you assuming
M^
that generates the number of welds for n that the lines must be horizontal or vertical?
strips is ^n(n - 1). Certainly, that's how the dots naturally
arrange themselves. . .but nobody said the
lines had to go in any particular direction.
Art deco-ration page 13
Diagonals would provide new possibilities.
Any valid solution would do fine, although
Then again, although the square of dots
This arrangement, a little like the Star of the solution illustrated boasts an impressive
1 1 triangles. has a natural square boundary, nothing in the
David on the Israeli flag, does the trick.
problem says that your lines have to stay
within that boundary. Mental walls. . .
The great value of an insight is that, once
gained, it may be applied, as a general rule,
to other similar problems. The solution is
shown below as a solid line.
Bridge the gaps page 16 A new angle page 19 Deluxe jewelry page 22
No. it is not possible to cross all seven By drawing the triangle on a sphere. Suppose The number of wires is 1, 3, 6, 10, 15... so
bridges only once each. Euler solved this the Earth was perfectly round. If you drew a we add + 1 , + 2, + 3, + 4, + 5. . .each time.
problem by replacing the real map with a line from the North Pole to the equator, then Therefore the series will continue 21, 28,
topological equivalent. He then postulated a quarter of the way around the equator, 36. . .and so on. These are the triangular
that you could complete the journey only if then back to the North Pole, the line would numbers, which we met in the answer to
there were either 0 or 2 places where an odd have turned 90 degrees at each stage.
number of routes meet. Since the Kbnigsberg Therefore the total of all three angles is 270
bridges area has four junctions with an odd degrees. This is called a trirectangular Runes page 22
number of lines, no solution can exist. page 12.
triangle. A triangle's angles total 180 degrees There are 12 possibilities with five clasps and
only when it is on a flat plane.
60 possible designs with six clasps. Suppose
we numbered the clasps from 1 to 6. If
At a stroke page 17 Janice draws the black line design around
For the general rule, consider this: There are
1 00% proof page 20
clasps 1, 3, 4, 6, 5, 2 (and back to 1) this is
essentially two different types of journey: (a) Cutting the smallest square into pieces allows the same as the design 6, 5, 2, 1, 3, 4 (and
ones we start and end at the same place, and us to reassemble it with the middle-sized back to 6) because they are the same loop,
(b) ones we end at a different place from shape to form the larger square. Since the just starting at a different point. So we need
where we started. In case (a), every junction square whose side is the hypotenuse has concern ourselves only with five points of the
exactly the same area as the two other squares route and can assume that all the loops start
must have an even number of "roads." This
is because for every junction we enter, we combined, we have proved the theorem. from the same point. At first there are five
have to be able to get out again so that we points to choose from, then four, then three,
can get back to our starting point. In case etc., so there are 5x4x3x2x1 =120
(b). we need even numbers of roads at every possibilities for six clasps. But, because each
intersection except for the start and finish design also looks the same when drawn
points, which must have odd numbers of backward, we need to halve this result,
which is where the answer 60 comes from.
roads. This is because we don't want to
return to the start point. For n clasps, the general formula is all the
So the general rule is: If a connected map numbers from 1 to (n - 1) multiplied
has 0 or 2 junctions where an odd number together then divided by 2. Mathematicians
of roads meet, it can be traversed. If there write this as (n - 1)1/2. The factorial symbol
are 0 odd junctions, you can start anywhere. ! represents the product of all the numbers.
If there are 2 odd junctions, those are your
start and finish points. Using this knowledge,
Galaxy game page 23
it's easy to see that the hot cross bun and One possible route is shown here:
diamond pattern (diagrams 1 and 4) can't
be traversed as they both have 4 odd
junctions. The envelope with flap (diagram 2)
Third base page 20
is possible as long as you start and finish If the two shorter sides of the triangle are 8
using the bottom corners because these are
and 17 units long, then 82 + 172 = x2, where
the two odd junctions. It is possible to
x is the number we seek. However, 82 + 172
complete the five-pointed star (diagram 3) = 353, and 353 doesn't have a square root
from anywhere. that is a whole number. Therefore, 17 must
be the length of the hypotenuse. In this case,
x2 + 82 = 17' = 289. Putting this another
Not impossible after all page m way, x2 = 289 - 64 = 225. The square root
Fold the page of the book and use the other of 225 is 15 (since 15x15 = 225), so the
side of the paper to get you out of sticky third side is 15 units long.
situations! Repeat as necessary until the
diagram is complete.
Pythagorean puzzle page 21
Here's how to arrange the pieces:
Child's play page 19
1 Scalene triangle — 1 way
2 Isosceles triangle — 2 ways
3 Parallelogram (slanted rectangle) — 2 ways The inventor of this puzzle. Sir William
4 Rhombus (slanted square) — 4 ways Rowan Hamilton, was born in Dublin in
5 Equilateral triangle — -6 ways 1805 and by the age of nine could speak
6 Square — 8 ways 13 different languages. He is best known in
7 Cross — 8 ways the fields of mathematics and astronomy.
8 Tetrahedron (pyramid) — 12 ways In 1828, he was made Astronomer Royal
9 Cube — 24 ways for Ireland. In the field of dynamics he
introduced Hamiltonian functions, which
Missing length page 19 express the sum of the kinetic and potential
energies of a moving object. They were
An isosceles triangle has two sides of equal
length (by definition) so the third side must important in the development of modern-
day quantum mechanics He originally sold
be 4 or 9 units long But it can't be 4 units the idea of his Hamilton game for £25
long, because you can't form a triangle with (about $38, which was about what $835 is
sides of 4, 4, and 9 units length (can you see worth today) in 1859.
why?) So the third side must be 9 units long.
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES 91
ANSWERS
A
Hexagon to triangle puzzle
H^^ffii
PAGE 38
E
in their original configuration because they
Upsizing page 25 form two more large triangles that complete
Yes. In fact, any number of workers can be the square. Six-pointed star puzzle page 38
<(h
<w
connected to the same number of offices
without their paths crossing. Try it and see
for yourself
►n
H
Boxing clever page 41 Sequestrate the siblings page 45 Domino derby page 52
This is the best solution to date. These Each room can be divided into four as follows: Other solutions are possible
A
problems are fiendishly difficult to prove
nmC
outright, and until someone comes up with a
proof, there's always a possibility that
someone can come up with a better solution. ► ^
<
A
Ernie's enigma page 48
Here are the completed diagrams. There may
be other solutions for any particular case.
K
Now try making up your own puzzles — there
are around 50 known ways of placing the
^
A±
tiles together so that all edges match.
Patio ratio page 42
The solutions for even-numbered squares (2
x 2, 4 x 4. 6 x 6 etc.) should be obvious — it's
just four squares of the same size taking up ^ ►
one quarter of the area of each.
The solutions for the other, odd-numbered
sizes are as follows:
Domino rally page 53
Other solutions are possible.
3x3
W
The Lo-shu magic square page 54
With a bit of luck these designs will earn All rows, columns, and both diagonals add up
Mr Moore some peace and quiet.
to the magic number 15.
m
Hexabits puzzle page 51 4 9 2
This is one possible answer.
3 5 7
8 1 6
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
ANSWERS
A diabolic square page 54 The tricky eight page 56 Devilish dozen page 57
This is called a diabolic magic square because The trick is to use fractions, as shown. Note This is one of several possible solutions.
there are a diabolical number of ways of that the middle box must always be one-
getting the magic number (34). For example, third of the magic number, making the 10
the numbers in each quarter of the large middle 8-5-2 column easy to establish. '
square total 34. The middle 2x2 square totals ■ ■
34. Some broken diagonals such as 2-8-9-15 3 5 8 12
total 34. How many others can you find?
Incidentally, the 15 and 14 in the bottom 4!4 8 2!4 11
row denote the year that Durer created
7 2 4
his etching.
•
3 5 7 ■
That's odd page 57
7!4 2 Note how the odd numbers have a very
5!4 simple arrangement, as if in diagonal rows
of different lengths:
3
9
1
6
2
4 x\\/\
n?\
18
Can you find a better solution?
36 12
X/\
94 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
ANSWERS
Hexagons or cubes page 62 For 4 yellow, 2 red: The two red beads can can be separate, and two unique ways with
either be next to each other, one bead apart, 2 reds + 1 red elsewhere. This is four in total.
Here's one possible solution. Put together in or two beads apart (i.e., opposite each This totals 1+1+3+4 = 9 ways so far. All
this way the hexagons resemble cubes.
other). This gives three unique possibilities. the other cases are the same as these with
For 3 yellow, 3 red: There is one way the the colors reversed, so there must be 18 in
reds can be all bunched up, one way the reds total, as shown here.
can be separate, and one unique way to
have 2 reds + 1 red elsewhere. This is three
in total.
So far, that is 1 + 1 + 3 + 3 = 8. However,
we can cut down the work for the remaining
three cases because they are the same as the
first three but with the colors reversed. So
the total is 2 x (1 + 1 + 3) + 3 = 13.
12
s£^0
there is a high degree of symmetry (by
necessity).
15
On guard page 68
Each of the squares in these 3 x 3 to 8 x 8
grids either contains a knight or is attacked
by one.
**i#
are given here. (an odd number), so will finish on a different of this one.
"
colorT square from the one on which he
'7 started. Opposite squares of an 8 x 8
1-Z chessboard are the same color.
-v-
«* 2§ The bishop's tour pace 71 ffl
til
Here is one way His Grace can do the
5-
3j* 3E rounds. Note that he has to start in one
white corner and finish in the other.
►n
B 1 way
b a HJ*J%
-f
rf "V J*S^>-r£ r*i H
^
t^
*S2S3 «i5 i! t< BJ5 ►!
tt
A
it1 ,*l
Big knight out page 69
Note that a knight always attacks squares
that are different from the color of square it
is currently on. A 7 x 7 chessboard has 25
black squares and 24 white squares. By7
-
Zt B * * C 6 ways. This is one of them.
51
placing one knight on every black square,
only white squares will be attacked.
Therefore, 25 is the correct answer.
The queen's tour pace 71
Here's one way to conduct the royal visit:
The rook's tour pace 70
A This is one solution. (It is surprising
how many 17-move solutions there are,
and how difficult it is to find a 16-move
solution like this.)
P S * II
B * II D There are 12 unique solutions for placing
eight queens on an 8 x 8 grid, only two of
II * B which don't use the main diagonals. This is
one of them.
II rA B irt
L : J kl
The grand tour pace 71
B The catch in the question was that Rook
had to enter every square just once — i.e., he It is not possible on any square chessboard
could revisit the start point. This makes the with an odd number of squares (such as
problem possible: 5 x 5 or 7 x 7). For example, on a 5 x 5
chessboard, the knight will make 24 jumps
before returning home. The knight will end
the 24th jump on a square of the same color
to the start position. The final leap back
home is therefore impossible, because a
knight cannot jump from a black square to
a black square (the same is true for white to
white). It is possible on a 6x6 chessboard. Chessboard jigsaw page 72
It's not possible, because removing two
opposite corners of the chessboard removes
two squares of the same color. Since each
2x1 piece contains a square of either color,
you will always be left with two individual
squares of the same color.
96 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
ANSWERS
ii
A B
ways of reaching each junction. This is made slightly harder by the
arrows pointing in different directions. There are 13 routes in all.
-■ ■■ U
1
in B
Fare's fair page 76 B There are many ways of creating a square in this geometry that all
look different. Here are three examples.
A It's not difficult to count that there are 10 different routes from A
to C, and so there must be 10 from C to B too. As each of these
routes is completely independent, there are 10 x 10 = 100 routes from
A to B via C.
^r
B Here, we have too many routes to count, but we can use a
standard method of writing down the number of ways of reaching a _£ i_
junction, much like the one used for the previous three problems.
There is only one way of reaching the north edge of the grid shown _ci_
and similarly for the east edge. Each intermediate junction is then the ^r
sum of the two numbers to the north and east of it.
^r
If we tilt the grid by 45 degrees, we get a pleasant triangular shape
in which every number is the sum of the two numbers immediately
above it. This is called Pascal's triangle, and is useful for all kinds of _C\
problems including the lottery result puzzles on page 58. For example,
the number of ways of guessing three balls from five possibilities is 10, ^.r
given by the third number in the fifth row (ignore the top 1). _Z\
The illustration shows that there are 210 ways of going from A to B
^7^
^
directly. Other interesting by-products of this triangle include the ^i..
-CX-
third diagonal (which generates the triangular numbers, something --£X.
u\-
else we've seen in this book) and the fourth diagonal (the pyramid
numbers — i.e.. numbers of cannonballs that can be arranged into _c\.
^r
pyramids with triangular bases). •N ^T
-£>--
^7^ ^7^~
_CX-
-C V
^7^
u
t\ J> .**
C Here is one example of a 14,
8, 6 triangle in taxicab geometry.
Id
UD ■ Winning Brams' game pace 83
This map is a 2-D equivalent of a
dodecahedron (a 12-sided regular solid).
Modern art pace 82 The maximizer can always win by playing the
same color on the face of the dodecahedron
A Two colors are required in each case. opposite where the opponent last played. Galactic domination pace 85
B One way to look at this is to add the lines The diagram below should make this Nine colors are necessary. 1 & 3 and 2 & 5
to the painting one by one. As each line is symmetry clearer. are the same colors. Incidentally, this problem
added, all you have to do is to interchange was originally proposed by mathematician
the colors on all regions that lie on one side Gerhard Ringel in 1950.
of the new line. This ensures that the colors
remain different across old boundaries,
and also across the new one thanks to the
interchange of colors. The same proof can
be generalized to apply to paintings in which
the boundaries are either single curves
that run right across the whole picture,
or closed loops.
Another way of looking at it is to notice
that these paintings have an even number of
edges meeting at any junction. This must be
true of any picture that can be colored with
just two colors, because the regions around a
junction or corner must be of alternate
colors. Therefore, any picture can be colored
using only two colors if, and only if, all its
junctions have an even number of edges World domination — Part 1
meeting there. This is known as the Two- PACE 84
Color Theorem
Here's one way for Sir Frederick's master plan
to work:
ff
ir
L7 ^?=L
t?
k. rz£b cD
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES 99
CUTOUTS
1)®©©©©©©®®
© ® ® ® © ® @ ® ® ®
1 00 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
CUTOUTS
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES 101
CUTOUTS
II I
I I I I
V I I \ I
I I I I /
I I
I
\ I \
I /
I I \
\
/ I I
I I
I I \
I II /
I
I I
1 02 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
CUTOUTS
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES 103
CUTOUTS
I I
I I
u I • u
I I
I I
n
I L j
■
c
11
U i
I I 11
I I
I I i
I
I I I l i i
I I I
I i
IM^^B^^BBfl
1 1
J I \
1 04 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
CUTOUTS
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES 105
CUTOUTS
Si
(O
110 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
CUTOUTS
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES 111
CUTOUTS
PolygO PACE 46
114 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
CUTOUTS
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES 115
CUTOUTS
Hexabits page 50
1 fcfct^
118 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
CUTOUTS
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES 119
CUTOUTS
^r
Permutino page 58
= = = - -
u
I
_
— ^1-
122 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
CUTOUTS
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES 123
CUTOUTS
HHBB
HHBB
BHHB
BH3B
1 24 DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES
CUTOUTS
DEVIOUSLY DIFFICULT MIND-BENDING PUZZLES 125
CUTOUTS
4,
£W3
^T^