This program can solve the hanoi towers puzzle for any given number of disk. It is assumed that in the begining of the game,the disks are only stacked on the first peg and there are three pegs. It was the French mathematician Edouard Lucas who invented these puzzle back in 1883. The simplest known solution to these puzzle is formulated using recursion and is also the method that was used in the current program.
File List:
@PSC_ReadMe_108_13.txt
1Kb
hanoi towers.lisp
2Kb
Similar code
A Basic Chatterbot
(Popularity: ) : This program implements a very basic program that can interact with a user Program like these one, (usualy more complex ...
Code Library
) : This program implements a very basic program that can interact with a user Program like these one, (usualy more complex ...