hanoi2.out

data structures, algorithms and Application书的源代码

Moves for a three disk problem are
Move disk 1 from tower 1 to tower 2
Move disk 2 from tower 1 to tower 3
Move disk 1 from tower 2 to tower 3
Move disk 3 from tower 1 to tower 2
Move disk 1 from tower 3 to tower 1
Move disk 2 from tower 3 to tower 2
Move disk 1 from tower 1 to tower 2