SourceForge.net Logo Home | Download | Submit | Screenshots | FAQ | SF Project Page | JUDO Help | Contact

View a Program

To run this program in JUDO, select the Program Code with your mouse, click the Edit menu of your browser and Copy. Then click in the code area of JUDO, click the Edit menu of JUDO and then Paste. Then Run the program.

Author Name:Edac Leinad
Program Name:Hanoi's Tower Solver
Program Description:Hanoi's Tower Solving Program by Edac Leinad
You may use this program for whatever purpose you will,
but please give credit to the original author.

Google Hanoi's Tower for more info.

Basically, it is a game that is extremely difficult with larger number of disks.
The goal: move all of the disks from peg 1 to peg 3.
Rules:
- You may only move one disk at a time
- You may only move a disk from one peg to another
- A disk can only be resting on a disk larger than it in radius (or no disk at all)

To try it out, I recommend that you read up on Hanoi's Tower by Googling it.
Enter a value for the number of disks, try 3 for a first
The program will solve and tell you the moves that you should do.

Tweak the showProgress variable for more info.

NOTE
I originally made this program in C++. if you would like the c++ version, please email me at nospam.flyndgs@gmail.com (remove nospam.)
 
Program Type:Text
Program Code:

Last Modified Sun Dec 22 07:25:00 UTC 2013
Thomas Dunn

Home | Download | Submit | Screenshots | FAQ | SF Project Page | JUDO Help | Contact