Author: Dann Corbit
Date: 14:55:51 12/10/02
Go up one level in this thread
On December 10, 2002 at 17:51:40, Ingo Lindam wrote: >On December 10, 2002 at 17:30:47, Dann Corbit wrote: > >>On December 10, 2002 at 13:42:36, Bernardo Wesler wrote: >>[snip] >>>THE ALGORITHM. A MATHEMATICAL FORMULA THAT , FOR EXAMPLE, ASSURE YOU THAT IF YOU >>>DO THE FIRST MOVE YOU ALWAYS WIN. >>>I MEAN TO THINK ABOUT DISCOVERING A CHESS ALGORITHM IS AN UTHOPY? >> >>Provably impossible on current hardware and software systems. >>Maybe in 100 years the game will be formally solved. Not in the near futre. > >provably impossible on current hardware...? >are you sure? Absolutely sure. To solve chess you must store at least the square root of nodes of the solution tree. Considering the half move clock and castle rights, it easily exhausts any possibility of solution. >without assuming anything about the kind of solution? No assumptions are necessary. We pick an adversary in the tree. It's just like how you would prove a sort works in O(f(n)). >atleast you are assuming the use of hardware... >(an assumtion I could live with because I wouldn't bet on find the solution >faster by using just a pencil and a sheet of paper :-)) I am assuming that if you turned the universe into silicon chips and devoted half of them to CPU's and the other half to memory storage that all the stars will go out before you find the answer. >me would like to see the proof for 'provably impossible' as much as I would like >to see the solution for chess > >internette gruesse, >ingo > >>BTW, your caps-lock key is stuck. >>[snip]
This page took 0.03 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.