Author: Antonio Dieguez
Date: 17:24:35 11/05/99
Go up one level in this thread
On November 05, 1999 at 15:59:00, J. Wesley Cleveland wrote: >On November 05, 1999 at 07:04:35, Antonio Dieguez wrote: > >>I just implemented recursive null-move, with a reduction of 2 plies. >> >>Obviusly a 1 ply reduction is safe enough, but 2, wich is the usual, for me >>looks not so safe, for example trusting that a yours-mine instead a >>mine-yours-mine-yours will give a minimum is a little optimistic isnt? and >>anybody have done a test about the percent of mistakes of the null-move or >>something? I mean when the score of the best move at the position, without >>null-move, results worse than the result doing null-move. > >This is easy to test. Where you do your null-move, instead of doing a cutoff, >just set a flag. When you return the real value, if it does not cause a cutoff, >it is a null-move error. Count the null-move errors, and total null-moves, and >get the percentage error. Another idea is to save the positions that cause >errors, and analyze them to see what they have in common. Yea I will do that, I just was thinking in a magic wand response tell me some results only :) be 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.