Author: Bruce Moreland
Date: 16:16:27 02/24/99
Go up one level in this thread
On February 24, 1999 at 15:37:58, Don Dailey wrote: >My program is a mixture of static rules and null move. I do null >move when I have significant depth remaining, but when I am near >end nodes I do a simple static attack analysis. This has proven >to be a significant improvement to my chess program. It is faster >than null move and slightly riskier, but the net affect is >a stronger chess program (for me.) Even though it's probably >riskier, it does pick up things null move will miss although the >converse is also true. Can you describe this or give examples please? I know that some people do this but I haven't the vaguest idea how it works. bruce
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.