Author: Tom Kerrigan
Date: 11:14:38 08/03/00
Go up one level in this thread
I have 3 search functions: root_search() search() quiesce() The first two are almost identical, except root_search has some extra stuff for the root of the search tree. Quiesce is not important to you, as you have no inclination to do a quiescence search. So yes, my program basically searches all plies the same way. In the endgame, my program usually searches between 800k and 1.1M NPS. (Pentium III/800) -Tom
This page took 0.03 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.