Description

Invented by the French mathematician Édouard Lucas in 1883, this is a mathematical game/puzzle about moving a set of disks between a set of pegs, limited by the following rules :

• Only one disk may be moved at a time.
• Each move consists of taking the upper disk from one of the pegs and sliding it onto another peg, on top of the other disks that may already be present on that peg.
• No disk may be placed on top of a smaller disk.

Solutions

http://svn.pugscode.org/pugs/examples/algorithms/hanoi.pl

Status with current release of perl 6 / parrot

• Parrot 5.1 December 2007 : compiler errors - subs and argv not implemented
• Parrot SVN Revision 24336 December 2007 : works without // and argv syntax (http://nopaste.snit.ch:8001/11939)
• Pugs SVN revision 18224 : works as is

Benchmarks

1000 iterations with 6 disks

• Pugs revision 18224 :

Comparisons against Perl 5, etc

• http://hop.perl.plover.com/Examples/ALL/hanoi # MJD's simple perl solution to Hanoi (further examples and detail in the Higher Order Perl book)
• http://www.kernelthread.com/hanoi/html/rb.html # simple ruby program to solve hanoi from command line
• http://www.ruby-forum.com/topic/107700 # object oriented ruby class to solve hanoi from command line and discussion thereof
• http://codegolf.com/tower-of-hanoi # golfing tower of hanoi
• http://www.kernelthread.com/hanoi/html/py.html # simple python solution

References

• http://mathworld.wolfram.com/TowerofHanoi.html
• http://en.wikipedia.org/wiki/Tower_of_Hanoi