The Tower of Hanoi puzzle was invented by the French mathematician
Edouard Lucas in 1883. We are given a tower of N discs, initially
stacked in decreasing size on the left peg. The objective is to transfer
the entire tower to the right peg, moving only one disk at a time and
never a larger one onto a smaller.

I found a lot of applets on the net simulating this puzzle, but none of
them showed the discs actually moving, so I thought I'd make an
animation where you can actually see the discs moving from peg to peg.
:)

I've heard that this puzzle has been implemented in just about every
programming language, since it's a classical example of a problem with a
simple recursive solution. Is it the first time it has been made in
POV-Ray?

Rune
--
3D images and anims, include files, tutorials and more:
rune|vision:  http://runevision.com (updated Oct 19)
POV-Ray Ring: http://webring.povray.co.uk

Post a reply to this message

Attachments:
Download 'hanoi.mpg' (257 KB)