Author: vitor
Date: 00:52:15 03/30/99
Go up one level in this thread
On March 28, 1999 at 13:57:44, José de Jesús García Ruvalcaba wrote: >On March 27, 1999 at 22:40:30, vitor wrote: > >>which search algorithms do you think the top chess programs use? is it all >>uniform or does one use some inovative algorithm no one else has thought of? i >>guess i'm just trying to figure out what seperates the top progs from the rest. >>any guesses? > > CilkChess uses MTD(f), and Crafty uses PVS. I do not know for others, but I >think most current chess programs use one of these two, or a slight variant of >them. > More interesting is which search extensions and pruning do they use (I would >call this the search policy). I think this is one of the most difficult problems >a chess programmer faces, as it is difficult to measure their usefulness (some >extension may help in some positions but only waste time in some others). thanks for the insightful reply. couple more questions. ive read that negascout is very similar to pvs. is there any distinction between them and if so, what are the pros and cons? what about mtd(f)? regarding pruning, aside from null move, what other pruning techniques are being used in top progs? or is it all about knowing the right way to implement nullmove?
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.