Author: Robert Hyatt
Date: 20:06:31 07/08/02
Go up one level in this thread
On July 08, 2002 at 13:37:18, Jon Dart wrote: >On July 08, 2002 at 13:07:06, Omid David wrote: > >>Although the risks of using null-move pruning in the recursive way (several >>times along a variation), are not so high, I didn't get great savings (reduced >>search effort) from it. To the best of my knowledge in the eraly 1990s no >>program used recursive null-move search. What's the standing now? > >Recursive null pruning was described in an ICCA article by Donninger (author of >the program Nimzo) in 1993. He got the idea from a hint dropped by a commercial >programmer (Frans Morsch?). Since it became public it has been widely used by >amateur programs. The commercial guys still mostly don't say what they are >doing. > >--Jon I think recursive null-move was described in a paper by Murray Campbell (and perhaps Tony Marsland) in the late 1980's. I know that was the first reference I saw of it and I added it right before an ACM event when he published that paper. In fact, Don Beal wrote the _first_ paper called "selective search without tears" although the paper by Campbell gave more interesting details...
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.