Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: A new(?) technique to recognize draws

Author: Dan Andersson

Date: 09:58:31 06/01/02

Go up one level in this thread


>
>I doubt that a PN search will help because the king usualy has many
>possibilities to escape the checks (otherwise the perpetual check may be
>detected also by hash relatively fast). So the tree may explode and PN not be
>very helpful.
The  state space must be small for the enumeration technique to work at all. So
PN search will most probably not explode either. The reason a perpetual will not
be detected is depth based not dependant on the breadth of the search. So a best
first seems appropriate. Especially if we cache the values of pre-computed
nodes.

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.