Page 107 - NUMINO Challenge_D1
P. 107
Type 12-1 Tower of Hanoi
Find the minimum number of moves
needed to move the 4 disks from Pole
A to another pole.
A BC
1 The minimum number of moves needed to move 1 disk to another pole is
1. If the minimum number of moves needed to move 'n' disks to another
pole is n , 1 1. Find the minimum number of moves needed to move 2
disks to another pole.
ABC ABC ABC ABC
Start Step 1 Step 2 Step 3
2
2 Find the minimum number of moves needed to move 3 disks to another
pole.
ABC ABC ABC ABC
Start Step 1 Step 2 Step 3
3
3 Find the minimum number of moves needed to move 4 disks to another
pole.
ABC ABC ABC ABC
Start Step 1 Step 2 Step 3
4
104 NUMINO Challenge D1
Find the minimum number of moves
needed to move the 4 disks from Pole
A to another pole.
A BC
1 The minimum number of moves needed to move 1 disk to another pole is
1. If the minimum number of moves needed to move 'n' disks to another
pole is n , 1 1. Find the minimum number of moves needed to move 2
disks to another pole.
ABC ABC ABC ABC
Start Step 1 Step 2 Step 3
2
2 Find the minimum number of moves needed to move 3 disks to another
pole.
ABC ABC ABC ABC
Start Step 1 Step 2 Step 3
3
3 Find the minimum number of moves needed to move 4 disks to another
pole.
ABC ABC ABC ABC
Start Step 1 Step 2 Step 3
4
104 NUMINO Challenge D1
