Dependencies in the Tower of
Hanoi
| Consider
the three disk Tower of Hanoi
problem that was discussed earlier in this course. Recall that
a disk, d1, may be moved from one peg, p1, to another peg, p2,
if disk d1 is clear (that is, no other disk is on top of it)
and if peg p2 is either empty or the top disk on p2 is larger
than d1. Create a solution for the three disk problem and then
represent this solution in the form of a triangle table. |
|
|
