Author: Robert Hyatt
Date: 05:17:30 01/19/99
Go up one level in this thread
On January 19, 1999 at 01:57:31, KarinsDad wrote: >On January 18, 1999 at 18:53:02, Robert Hyatt wrote: > >[snip] > >>This is a classic question that can be answered experimentally. There is no >>'holy grail' for all programs. The iteration-to-iteration swings can cause each >>program to have different. > >Robert, > >What is iteration to iteration swings? Is this when you search one more ply >deeper? > >Isn't the difference in "optimal" alpha beta window between programs due to >their evaluation function? Or am I missing something? Is there any other >components (within a program) which would give varying results in an optimal >alpha beta window between programs? think about the value of a 'tempi'. Most good chess books would say that 3 tempi are worth about a pawn (hence why gambits work). Which means that if you search one ply deeper, the side getting the extra move should see some sort of advantage to the extra move he gets. So for an N ply search, you could see scores like this: ply=1 +30, ply=2, 0, ply=3, +35, ply=4, +5, etc... > >Thanks :) > >KarinsDad > >> >>Try it with different windows, over a large test of positions, and just pick the >>window that works best (produces the fastest time-to-depth.) One trick.. watch >>your odd/even score swings (if you have them). And if you see them in your >>program, anticipate by correcting the window so that the odd/even swings don't >>take you over the edge too frequently...
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.