Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: search reductions?

Author: Dan Andersson

Date: 04:38:31 11/17/03

Go up one level in this thread


 You need to think your pruning algorithms through. Just shoveling them in don't
mean you get a faster/deeper searcher. Preferably the set of algorithms should
be orthogonal. For example there is no use having a scheme that activates only
in parts of the tree that would be pruned by nullmove. Even if the pruning does
activate outside the pruning window of another technique the overhead might not
be overcome at attainable search depths.

MvH Dan Andersson



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.