Author: Bert van den Akker
Date: 06:10:12 11/19/00
Go up one level in this thread
On November 18, 2000 at 13:39:39, Jorge Pichard wrote: >Does anybody know which programs use which method and which aproach is yielding >a better result? I think a brute force program with only null move pruning added is at least 100 elo points stronger the pure brute force program because it will search 1 or 2 ply deeper. Most programs use selective search. But what is selective search? A brute force program with: a. null move pruning b. (extended) futility pruning c. rasoring d. cutting a part of the search tree with knowledge (used in rebel) e. extension if in check f. threat extension g. singulair extension h. forced move extension i. ?? Who makes the list complete with a reference where they are described. BvdA
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.