Author: John Coffey
Date: 15:51:00 09/15/98
Let say hypothetically that I have a program that is doing a simple 3 ply search, but will extend its look ahead for every capture. The question becomes, how far should the look ahead be extended? The last time I wrote a chess program (1987) I found that the program would examine frivilous captures out to infinity if I didn't put a limit on it. (I literally had 20 captures in a row.) So say I limit the extensions to 2*N, where if N is 3 then 2*N equals 6. Seems to me that this might not yield an accurate result and could still give lots of frivilous captures. John Coffey
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.