Author: martin fierz
Date: 19:06:53 12/05/01
Go up one level in this thread
On December 05, 2001 at 03:12:49, Russell Reagan wrote: >In other words, is it possible to write a program that is better suited for >searching to deeper depths if it were given, say, 1 year to search for the best >move? Or are current algorithms about as good as we're going to get in long term >analysis? yes, you can improve a program for deep searches. i wrote a connect 4 program once, which (like all decent connect 4 programs) can solve the game in some hours. however, the time to solution depended a lot on the hashtable settings - of course, the larger, the better, but the replacement scheme you use is also important: "always replace" is often used, but not good for deep searches. for deep searches you should take care not to overwrite entries in the hashtable close to the root. for shallow searches this is not important, because you don't fill the hashtable anyway, so you don't need to watch out for this. unfortunately, i have no hard data on this, just my leaky memory... in my checkers program, i have observed similar things. cheers martin
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.