POV-Ray : Newsgroups : povray.binaries.animations : Towers of Hanoi ( 256 KB mpg ) : Re: Towers of Hanoi ( 256 KB mpg ) Server Time
19 Jul 2024 13:26:57 EDT (-0400)
  Re: Towers of Hanoi ( 256 KB mpg )  
From: Timothy R  Cook
Date: 3 Nov 2002 13:08:55
Message: <3dc56637$1@news.povray.org>
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

Copyright 2003-2023 Persistence of Vision Raytracer Pty. Ltd.