Author: Peter Fendrich
Date: 11:36:44 08/03/99
Go up one level in this thread
On August 02, 1999 at 19:41:14, Landon Rabern wrote: >How much should adding a q-search to my program improve its performance? When >playing games against the version without the q-search it seems about even. >Both are set at 7 ply. > >Thanks, > >Landon The only reason I can find, except bugs of course, that you get an even result is that you really stop the search at 7 ply in both cases. The Qs version ought to win "all" the time even if you set 6 ply + Qs against 7 ply without. Hmm, I'll bet 5 ply + Qs would do it if it's bug free. You should have a time limit instead and using an iterative approach at he root node to get some reliable results. //Peter
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.