|
Explaination of the Buneman-Levy Algorithm
- Based on observation that at any stage of the solution the smallest disk is
available to move and can go to either of the remaining pegs.
- Once smallest disk moved, pointless to move it again, leaving only
one remaining move; move the second smallest disk to the other peg not
occupied by the smallest disk.
- Restrict the smallest disk to move clockwise.
|
