Author: Bruce Moreland
Date: 10:14:53 10/01/98
Go up one level in this thread
On October 01, 1998 at 10:37:00, Don Dailey wrote: >The reason the linear search algorithm is so cheap (even in endgames) >is that most chess program try capture moves first in the search. >The number of lines where the maximum number of irreversible moves >gets high is exceedingly small. The worst case scenario is limited >to positions where no captures or pawn moves are possible or ever will >be such as locked pawn endgames with no intrusion sqaures. If I had one concern about this it would be that when people test, they tend to do it from positions where the fifty-move counter is zero. I'd be concerned that if there had been a period of extended maneuvering, your performance might degrade. 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.