navbar-top.gif
btn_spacer.gifHomeTopicsLatestRandomAboutFAQsParticipateAuthoring Areabtn_spacer.gif

Towers of Hanoi
The towers of Hanoi starts with a stack of disks on the left stick. You can move a disk to an empty stick or on top of a larger disk. The problem is to move all the disks to the right stick.

Show Initialization Code
(28 lines omitted)



"Towers of Hanoi" from The Wolfram Demonstrations Project
 http://demonstrations.wolfram.com/TowersOfHanoi/
Contributed by: Jay Warendorff
Based on a program by: Jaime Rangel-Mondragón
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. We will keep your information private. We will not give it to any third party.
Privacy Policy »
©  2008 The Wolfram Demonstrations Project & Contributors    Wolfram Research    Site Index    Terms of Use    Privacy Policy    RSS    Atom