Author: Bruce Cleaver
Date: 12:03:04 05/29/98
Whatever happened to the old Russian idea of 'Method of Analogies' whereby foolish moves would not be searched until conditions that refuted them changed? This idea was described in David Levy's book "How Computers Play Chess". Too slow? Unreliable? Hard to implement? Thanks in advance, 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.