Computer Chess Club Archives




Subject: Re: Search algorithms in chess programs

Author: Gian-Carlo Pascutto

Date: 06:26:37 12/13/01

Go up one level in this thread

On December 12, 2001 at 23:27:58, Russell Reagan wrote:

>Depth-first search is usually what is used in chess programs (at least all that
>I have seen source for). What are the drawbacks of other search algorithms such
>as breadth-first and best-first that prevent them from being more widely used in
>chess programs?

Sjeng versions prior to 12 Leiden contain a proof-number
searcher for finding mates. They are used when playing
suicide or losers chess.

The advantage of this method is that is finds mates much
faster than alphabeta.

The drawback is that it uses memory at very high rate (for
storing the entire game tree in memory), making it somewhat
impractical for longer searches.

Proof-number search is a best-first algorithm.


This page took 0.22 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.