Author: John Coffey
Date: 09:27:03 03/11/99
I wonder how many programs deliberately use much more time on certain moves?
Since I have never seen an explanation of how anit-gm works........
I HAVE a theory on how "anti-gm" might work on some programs. I
think that if the programs finds that it doesn't have the advantage
after doing a normal search, that it might increase the compute time
for that move by a factor of 3 (resulting in a 1 ply deeper search.)
Then it has to make up that time by taking less time for other moves.
The advantage of this method is that is allows the computer to adjust
to positions that might be more difficult than others. In other
words it would use its time more where it is needed.
Seems like a good strategy for humans too. :-)
Of course, I could be completely wrong here. :-)
John Coffey
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.