Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Proposal: New testing methods for SSDF (1)

Author: blass uri

Date: 13:22:05 04/13/98

Go up one level in this thread



On April 13, 1998 at 15:21:51, Amir Ban wrote:

>On April 13, 1998 at 10:42:39, Jeroen Noomen wrote:
>
>>50 testpositions to test playing strength of chess programs
>>===========================================
>>
>>Position 1:  Ruy Lopez (1)
>>-------------------------------------
>>1. e4 e5 2. Nf3 Nc6 3. Bb5 a6 4. Ba4 Nf6 5. 0-0 Be7 6. Re1 b5 7. Bb3 d6
>>8. c3 0-0 9. h3 Bb7
>>
>
>Jeroen,
>
>This part of your otherwise thoughtful post is 1) futile 2) dangerous.
>
>It's futile because for any fixed set of positions programmers will try
>to extend the lines with pre-calculated moves, both to save time, and to
>avoid mistakes. Just like we do now in the starting position. It's the
>natural thing to do, and you can do nothing about it.
the set of positions does not has to be fixed
we can choose 10 positions from the next competition of category 18
in move 20 for example(and the next always changes)
Uri



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.