Page 105 - NUMINO Challenge_D1
P. 105
12 Tower of Hanoi and Pascal's Triangle
Basic Concepts Tower of Hanoi
Tower of Hanoi is a type of puzzle. There are
three poles and several disks of different sizes.
The disks stacked on one pole must all be
moved to a different pole in the same order.
Only one disk may be moved at a time, and larger disks cannot be placed
on top of smaller disks. If there are 'n' number of disks, the minimum
number of moves needed to move disks from one pole to another is
(2 2 2 1). )
n times
Example 2 disks are stacked on a pole. If the disks are moved using the
given rules, what is the minimum number of moves needed to
move the disks to another pole?
Rules
1. Only one disk may be moved at a time.
2. Larger disks cannot be placed on top of smaller disks.
Class Notes ABC
The following drawings show how to move 2 disks from one pole to another. The minimum
number of moves needed to move 2 disks to another pole is .
ABC ABC
Start Step 1
ABC ABC
Step 2 Step 3
102 NUMINO Challenge D1
Basic Concepts Tower of Hanoi
Tower of Hanoi is a type of puzzle. There are
three poles and several disks of different sizes.
The disks stacked on one pole must all be
moved to a different pole in the same order.
Only one disk may be moved at a time, and larger disks cannot be placed
on top of smaller disks. If there are 'n' number of disks, the minimum
number of moves needed to move disks from one pole to another is
(2 2 2 1). )
n times
Example 2 disks are stacked on a pole. If the disks are moved using the
given rules, what is the minimum number of moves needed to
move the disks to another pole?
Rules
1. Only one disk may be moved at a time.
2. Larger disks cannot be placed on top of smaller disks.
Class Notes ABC
The following drawings show how to move 2 disks from one pole to another. The minimum
number of moves needed to move 2 disks to another pole is .
ABC ABC
Start Step 1
ABC ABC
Step 2 Step 3
102 NUMINO Challenge D1
