Author: Dann Corbit
Date: 10:06:38 01/15/01
Go up one level in this thread
On January 15, 2001 at 13:01:39, Uri Blass wrote: >On January 15, 2001 at 12:56:14, Dann Corbit wrote: > >>On January 15, 2001 at 12:24:10, Uri Blass wrote: >> >>>It is possible to use some games and a lot of computer time to genrate a test >>>suite. >>> >>>The idea is to give some top programs to analyze all the positions in the games >>>and to give them 24 hours per position. >>> >>>The test suite can include all the positions that there was an agreement between >>>all the top programs about the best move after 24 hours of search when part of >>>them needed more than 3 minutes to converge to the best move(otherwise the >>>position is too easy). >>> >>>People can claim that the fact that all of the program converge to the same move >>>is not a proof that it is the best move and I agree but I think that in >>>more than 90% of the cases the solution will be correct. >> >>On the SSDF is a positional test suite similar to the one that you propose. > >I remember that the test suite of the ssdf give some options for every move when >there is not only one move. > >It is impossible to give more than one option in my test. > >I also have doubts about the question if the solutions are correct. > >If I know that all top programs converge after 24 hours to the solution then I >believe more in the test. The reason that I mention that particular test is because it is very thoroughly documented. I refer (of course) to this one: Given this search: http://www.google.com/search?q=berkeley+sis This is the 3rd listing: http://home.interact.se/~w100107/fentest.htm
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.