Towers of Hanoi | JavaScriptSource

Towers of Hanoi

Premshree Pillai Apr 18, 2005


The problem in Towers of Hanoi is to move all the disks from the first tower (leftmost) to the third tower (rightmost), subject to the condition that only one disk can be moved at a time, and that no disk is ever allowed to be placed on top of a smaller disk.

To download the zip file for this program, click here.

This Program can list the instructions for obtaining the solution and also simulates the solution for any number of disks.


Leave a Response