Author: Antonio Dieguez
Date: 04:04:35 11/05/99
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. Also am seeing not so much improvement, just from 1/2 to 1 ply. Another question, where do you make it works? in every node if eval>beta+a (a could be 0) from profundity let say n to the final or from a constant distance of the final (from final-n to the final) ? Thanks.Sorry my bad english and have a nice day!
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.