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)

Really??? I was told that it was a puzzle that was done by some monks...
when they would transfer all the tower to the other peg, the end of the
world would come... of course it was with many rings, so even if they tried
to move each peg every second, they would finish in a quadrillion putrillion
gazillion years :)

Now, about your animation, I liked it very much!

Fernando.



news:3dc483b3@news.povray.org...
> 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

> Really??? I was told that it was a puzzle that was
> done by some monks... when they would transfer all
> the tower to the other peg, the end of the world
> would come...

Yeah, I heard that version too.

> of course it was with many rings, so even if they
> tried to move each peg every second, they would
> finish in a quadrillion putrillion gazillion years :)

I think it was 64 discs, so that's 2^64-1 moves, which would be about
584558050400 years if a disc is moved every second. :)

> Now, about your animation, I liked it very much!

Thank you. :)

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

Rune wrote:
> I think it was 64 discs, so that's 2^64-1 moves, which would be about
> 584558050400 years if a disc is moved every second. :)



"Computer chess?  Forget it.  Since a chess player has about 30 moves to
choose from on each turn, and his opponent has about 30 possible answers
to each of these 30 moves, there are roughly 1,000 variations to just
one complete move.  Each of these complete moves allows another 1,000
potential moves, and so on.  Thus, a computer would have to consider
about 10+E75 (1 and 75 zeroes) moves to determine the outcome of a short
25-move game.  Even if the computer could calculate a million moves each
second--far more than is now feasible--it would require 10+E89 seconds
to complete the calculations for the game.
   How long is that?  Well, since the beginning of our solar system, 4.5
billion years ago, only 10+E18 seconds have elapsed."

Earth Simulator does, what, 40 TFLOPS/peak?  Compared to the 1 MFLOPS
proposed by the book...
...besides, chess programs don't work by calculating every single move.

-- 
Tim Cook
http://empyrean.scifi-fantasy.com
mirror: http://personal.lig.bellsouth.net/lig/z/9/z993126

-----BEGIN GEEK CODE BLOCK-----
Version: 3.12
GFA dpu- s: a?-- C++(++++) U P? L E--- W++(+++)>$
N++ o? K- w(+) O? M-(--) V? PS+(+++) PE(--) Y(--)
PGP-(--) t* 5++>+++++ X+ R* tv+ b++(+++) DI
D++(---) G(++) e*>++ h+ !r--- !y--
------END GEEK CODE BLOCK------

Post a reply to this message

This looks nice. You should work a little on the lighting
(making it smoother and more realistic),
and in the final move, rotate the camera by 180 degrees,
and watch the lighting etc to make the animation
looping...

Regards,
Tim

--
Tim Nikias
Homepage: http://www.digitaltwilight.de/no_lights/index.html
Email: Tim### [at] gmxde

Post a reply to this message

RADIOSITY!! RADIOSITY!! RADIOSITY!!

Tim Nikias wrote:
>This looks nice. You should work a little on the lighting
>(making it smoother and more realistic),
>and in the final move, rotate the camera by 180 degrees,
>and watch the lighting etc to make the animation
>looping...
>
>Regards,
>Tim
>
>--
>Tim Nikias
>Homepage: http://www.digitaltwilight.de/no_lights/index.html
>Email: Tim### [at] gmxde
>

Post a reply to this message

Tim Nikias wrote:
> This looks nice. You should work a little on
> the lighting (making it smoother and more
> realistic), and in the final move, rotate the
> camera by 180 degrees, and watch the lighting
> etc to make the animation looping...

Thanks for the suggestions, but I don't really think this animation is
worth investing a lot more time in. Just a small test. :)

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

Just So everybody can enjoy my "When I was young we didn't have graphic 
engines...

My first graphics assignment in College was to do a towers of Hanoi 
animation. We didn't have pixel graphics, I had to do it using ascii 
characters, screen clears, and character writes from arrays. Did it in 
Pascal on a VMS System.

But Rune, mine did have better radiosity then yours. JUST KIDDING. I 
think your animation is great.

James

Post a reply to this message

in article 3DC### [at] hotmailcom, James N Foster III at
myd### [at] hotmailcom wrote on 6/11/02 4:54 pm:

> Just So everybody can enjoy my "When I was young we didn't have graphic
> engines...
> 
> My first graphics assignment in College was to do a towers of Hanoi
> animation. We didn't have pixel graphics, I had to do it using ascii
> characters, screen clears, and character writes from arrays. Did it in
> Pascal on a VMS System.

Thank God technology has improved. I did mine in C.


All the best

Fidel.

Post a reply to this message

Hi all..

Well.. Thanks Rune : you just reminded me that i've done something in
early 1997..

Not so well finished (i'm not good at that..), as i was interested in
animation mechanism.

Technical stuff :
- just 8 hours on a p3-450 (need to do the screen pics first.)
- files was converted for pov 3.5, with little change in
shape/light/position
- as i said, textures are "fabulous"... :)
- no radiosity (i tried, but too many artifacts, and _way_ slow)

Full anim can be found here (warning : 5.2Mb !)
http://www.profd.com/rt-site/pictures/Animation1-2.avi

(if wmp doesn't launch automaticaly, open it and paste the link in the
open box..
you know it.. :))

Join is a first 40 pics sample anim of this 1084 pics animation..

Comments welcome (do i have to continue with that, 5 years later ?.. or
should i
keep that on cd and forget it ?.. :))

Thanks to read..
--
FD
Mode { NOSPAM } = On ;

Post a reply to this message

Attachments:
Download 'sample.avi.dat' (272 KB)