Author: Don Dailey
Date: 14:06:44 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 We are doing research in this area. The idea (as we are trying to use it) is to be able to judge similar positions as having the same value (or close to it.) With a detailed analysis you can prove a small search will not return a score significantly different than a related position. There are a lot of interesting ideas to be exploited. I believe Deep Blue has also experimented with this and may even have implemented something. - Don
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.