Author: David Blackman
Date: 23:40:37 05/29/98
Go up one level in this thread
On May 29, 1998 at 15:03:04, Bruce Cleaver wrote: >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 I tried adding this to my program, in a few different but very simple ways. The result was usually that the program got slightly weaker. If i trusted the idea too much and relied on it completely, the program made tactical errors and got a lot weaker. This probably just means that i wasn't clever enough to make it work properly. I will definitely try it again at some stage. This is one of those ideas that looks obvious, but is very hard to implement sensibly. A few programmers admit to experimenting with it, but i haven't heard of even one strong program that actually uses it in competition.
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.