Author: Sune Fischer
Date: 09:11:16 09/18/03
Go up one level in this thread
On September 18, 2003 at 11:02:38, Tony Werten wrote: >>So, assuming a branching factor of 4, and game length of 50 plies, there are >>about 4 ^ 50 = 1267650600228229401496703205376 positions to search. Assuming you >>can search 100 million positions per second, it will take you about >>401969368413314 _years_ to finish the computation! > >Your off by a factor of a couple of billion since there are only >29019905518636890 possible different positions. I suspect the number of possible game paths is far greater then the number of possible positions, since by definition a position is only possible if there is a path leading to it. -S. >At most a little less than 10 years of computation. (Pure minimax that is) > >Tony > >> >>However, there will be a huge hash table hit rate (about 99% I guess), and you >>can also benefit from many symmetrical positions (which arise by mirroring >>another position). So, I think this position is solvable by brute force. Good >>luck!
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.