Author: Gareth McCaughan
Date: 18:43:36 04/09/01
Go up one level in this thread
Dan Andersson wrote: > They are certainly a good candidate but their description was > not of full a-b pruning, or at least their description was > too vague to discriminate it from a less pruning algorithm. > For details go to the aforementioned Knuth and Moore paper. Which can be found, by the way, in Knuth's excellent "Selected papers on analysis of algorithms", published by CSLI Publications. -- Gareth McCaughan
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.