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