Computer Chess Club Archives




Subject: Re: If you want solve one mate...

Author: leonid

Date: 13:56:26 01/22/01

Go up one level in this thread

On January 22, 2001 at 14:18:12, Gian-Carlo Pascutto wrote:

>On January 22, 2001 at 14:02:25, Gian-Carlo Pascutto wrote:
>>No way to tell for sure. The algorithm is highly selective best-first
>>so there is no guarantee whatsoever that what it finds is the shortest
>>mate. You could establish a lowerbound by checking the maximum depth it
>>reached, but it follows forced lines very deeply...
>Oops! I meant an upperbound of course.
>In this case the deepest line looked at was 23 plies, so it's a mate in
>12 moves or less.

Thanks! Forget about question that I make for you before. I felt that there
something was wrong. Very often some mistakes with specific wording lead me into
trouble. I thought that this time it was just this.

Can you in few words describe your mate solver and if it is free program where I
can see it.



This page took 0.02 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.