Author: Don Dailey
Date: 15:44:35 02/06/98
Go up one level in this thread
On February 06, 1998 at 14:02:11, Stuart Cracraft wrote: >A number of years ago, commercial programs like Lang's, and others >seemed to get about 100 points stronger due to being selective >searchers over their brute-force full-width, with capture quiescence >counterparts. > >Is this true? If so, what are the nature of the changes involved? > >Thanks, >Stuart Hi Stuart, You need to know about null move searching if you are writting a chess program. There are some good articles in ICCA past issues and you should definitely try to dig them up. Just about every program now uses it but there are a few exceptions. No one knows for sure what Richard Lang does but it's likely to involve similar ideas. If you want I can send you the basic idea and some psuedo code. - Don
This page took 0.01 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.