Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Sven Richard or Dann Corbit

Author: leonid

Date: 15:47:43 10/06/99

Go up one level in this thread


On October 06, 1999 at 15:37:46, Dann Corbit wrote:

>On October 06, 1999 at 13:31:08, leonid wrote:
>>Hi!
>>
>>You spoke both about the trying some positions. Can one of you come and explain
>>more about this trying.
>>On the page where I went to see the positions I found no E-mail on the place
>>to ask my questions.
>
>Your question is vague, but I will attempt to answer what I think you are
>asking.
>
>If you have an EPD position (EPD is a subset of the PGN standard) then you can
>analyze it with a number of tools like Rebel, Hiarcs, or Crafty.  After
>analysis, you can examine the output to see how it turned out.  Some special
>test suites have been developed to test the computer's ability to solve
>problems.  The human GM's have decided what they think the best move(s) is(are)
>and perhaps also what move(s) to avoid.  You can look at the output and see how
>your computer tool did verses what the GM thought.
>
>Does that answer your question or am I totally on the wrong page?

Thanks for response!

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. 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.

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.

If you have something of this kind, please make me know.
Leonid.



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.