Three pegs · A to C
Start 3,2,1 bottom to top on A. C is the target.
A
Stack here
B
Stack here
C
Stack here
Three-disk tower transfer: rules and printable materials
Move a stack between pegs one disk at a time without placing a larger disk on a smaller one.
- Players
- 1–4
- Plan for
- 10–15 minutes
- Bring
- Three-peg mat, three numbered paper disks and move log
Build the starting stack
Lay out pegs A, B and C on the printed mat. Place disk 3, then 2, then 1 on A, largest at the bottom. C is the target; B is spare space. Use flat paper disks stacked loosely, not rods or anything sharp. The printed circles show sizes and numbers so both ordering and touch remain clear. One to four people may solve together.
Move one top disk
Each step transfers only the top disk from one peg to the top of another. Empty pegs accept any disk. An occupied peg accepts a smaller disk only; never place 3 on 2 or 1, or 2 on 1. You may not carry a complete stack or leave a disk between pegs. Record the disk number and both peg letters before the next move.
Follow a legal opening
Move disk 1 from A to C, disk 2 from A to B, then disk 1 from C to B. B now has 2 below 1; A still has 3. Move disk 3 from A to C. This creates space for the small stack without breaking the top-only rule. Seeing a free target does not allow reaching underneath another disk.
Complete and check
Continue 1 from B to A, 2 from B to C, then 1 from A to C. All three disks are on C in order after seven moves. This is a checked route, not a promise that a first attempt must be optimal. If a rule is broken, return to the last recorded legal position and resume; do not count an illegal stack as solved.
Try before reading the key
Keep the solution sheet with a host or folded away. Swap the mover after two moves when playing as a group, while another guest checks the log. Stop after a valid transfer or the announced ten-minute attempt, then demonstrate the route. The two-disk warm-up uses disks 1 and 2 only. Do not add more disks without also allowing a longer session.
Printable materials
Preview at 100% scale, with browser headers and footers off. Cut with suitable help. Keep host keys separate. This is a manual tabletop kit, not an online opponent, automatic judge or solver.
Three disks and move log
3
2
1
| Move | Disk | From | To |
|---|---|---|---|
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
Host solution · seven legal moves
| Move | Disk | From → to |
|---|---|---|
| 1 | 1 | A → C |
| 2 | 2 | A → B |
| 3 | 1 | C → B |
| 4 | 3 | A → C |
| 5 | 1 | B → A |
| 6 | 2 | B → C |
| 7 | 1 | A → C |