Author: Jeff Anderson
Date: 22:19:09 08/06/98
How exactly does a selective search work? Does the program search to a certain depth x then eliminate the worst moves, and then search the ones it did not eliminate? If so at what depth does it do this? Does it only do this once, or does it perhaps eliminate more moves deeper in the search, removing more and more moves as the search progresses? Is the number of moves eliminated dependent on the position? If any of the programmers, or anyother computer chess erudite could describe in detail how it works, I would be grateful. Jeff
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.