Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: If you like to solve a mate...(proof number search)

Author: Gian-Carlo Pascutto

Date: 01:48:40 02/07/01

Go up one level in this thread


On February 06, 2001 at 18:10:04, Dan Andersson wrote:

>One cannot search all that deep in crazyhouse as the amount of
>possible moves are high (It may be that the number of transpositions make up
>for that, but I doubt it)

You have to prune more to keep the tree under control.

>hence I wanted something that would signal if a leaf
>position was a forced win or loss (Obviously the number of nodes to be searched
>need to be limited, in a dynamic way)

Surely even with a limited pnsearch that must be a very expensive
evaluation. Hence you will search even less deep...you might not
fall for forced mates as easily, but you will be tactically and
positionally weaker. For opponents up to the 2200 level you will
do fine because they will walk into a mate sooner or later, but
you will get toasted vs. the better ones.

I'd like to see your program in action...I do not think this
approach can work but I'd be interesting if you can prove me
wrong ;)

--
GCP



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.