Related articles:
Hanoi
Recursion
Puzzle
Problem solving
Gray code
Key terms:
peg
hanoi
gc
one peg
peg t
m h f t
peg f
largest disk
tower of hanoi
smallest disk
same peg
peg r
source lang
another peg
destination peg
smaller disks
remaining third peg
reve
modulo n
stacked on top
distributions of disks
starting peg
n disks
optimal solution
four pegs
three pegs
longest non
hamilton path
disks from one peg
recursive algorithm
move the smallest disk
number gc
smallest piece
recursive solution
peg f to peg t
peg b
shortest sequence of moves
tower of h disks
final peg
shortest paths
quotient m
h f t r
onto m h f t
remaining third peg during
smaller disks from peg
initial peg
one peg onto another one
peg c
corresponding disk
tower from one peg
Search external links cited by footnotes on Wikipedia page Tower of Hanoi:
|
|