Author: Sune Fischer
Date: 06:29:19 04/06/03
Go up one level in this thread
On April 06, 2003 at 09:20:05, Dan Andersson wrote: > I was talking about a formula not an algorithm. Big difference. And even an >algorithm would be wildly impractical for a number of reasons. First you would >have to have the whole tree in storage. Then you would have to try or disprove >every possible combination of hashing and move ordering on that tree. So you >would have an immense data set. And do a combinatorial search on that data set. >This search would dwarf the Travelling Salesman problem like the seas dwarf a >glass of water. To get some grip on its size, you would have to use Compression >and Information theory. > >MvH Dan Andersson Of course. Chess is not a mathematicly solved game. -S.
This page took 0 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.