Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Sven Richard or Dann Corbit

Author: Dann Corbit

Date: 17:16:29 10/06/99

Go up one level in this thread


On October 06, 1999 at 18:47:43, leonid wrote:
[snip]
>Partially your response is just for me. When your are trying to see if the
>program found correctly all the the possibilities for best move in given
>position, it is already what I am looking for. But this work 100% only for the
>mate positions. For other positions it is problematic.
Mate positions are probably the worst.  The only way to get a sure "best mate"
is to use a tool like Heiner Marxen's checkmate sovlver "Chest" which is not
available quite yet.  (Others are but they do not work as well).  Many chess
programs will find a mate but not the closest ones.  And "usually" a mate solver
will solve much more quickly than a chess playing program.  The exception is
tablebase files, which might report "Mate in 127" instantly.

>Will not say any more on
>the subject (if not I can speak for too long). I am looking for data that can
>say me more about the speed of some games, in order of recognizing mine. This I
>could do if in your data you have something like this:
>
>1) Speed at which the mate was found when that time is longer that 20 seconds.
>Search should be done by "brute force". This can revel the speed of the game,
>or at least the speed of the part of chess game that solve the mate.
The checkmate finding problem suites (such as BWTC) are among the worst as far
as bugs go.  Examples -- some problems will say "the best move is <foo> and is
mate in 8", but really you will get checkmated yourself in 5 no matter what you
do [surprisingly there are a *lot* of those].  Often, there are shorter mates or
alternative mates that the test suite was unaware of.  Can we say that a move
that results directly and securely in checkmate is not the best move?

>2) Speed of the chess logic when mate is not there. This speed says  about
>"positional logic" agility. Search should go at fixed depth by "brute force".
>Time for solution should be beyond 20 seconds to be easely comparable.
Most test positions are not checkmate, but rather bm (best move) which does not
lead directly to mate.

>If you have something of this kind, please make me know.
I have something of this kind.  It is in the directory:
ftp://38.168.214.175/pub/Public_CAP_Results/Apocalypse/

Have fun.  HTH.




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.