Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Details on the matches Tiger vs Diep and Tiger vs Crafty?

Author: Vincent Diepeveen

Date: 14:07:31 12/22/99

Go up one level in this thread


On December 22, 1999 at 16:38:15, Christophe Theron wrote:

>On December 22, 1999 at 15:08:29, blass uri wrote:
>
>>On December 22, 1999 at 10:27:41, Vincent Diepeveen wrote:
>>
>><snipped>
>>>Well about the DIEP - Tiger match
>>>
>>>DIEP (single cpu version) with book without learning
>>>against Tiger without book but with learning.
>>
>>1)I did not know that tiger has learning without book.
>>I understood that tiger's learning is only avoiding repeating the same losing
>>line again.
>>
>>I understood that doubles will not be count for this reason.
>>
>>2)I guess that tiger is going to win the match because it is simply impossible
>>to be number 1 in the ssdf list only by a book.
>>
>>It is possible only if you do a lot of testing against computers and save the
>>games you won as part of your opening book but I do not believe that someone
>>does it and if someone will work hard to do it then it will be revealed when the
>>program is going to lose against weak opponents that it did not train against
>>but tiger did not lose matches against weak opponents in the ssdf games.
>>
>>Uri
>
>
>I don't have most of the programs Tiger played against on the SSDF. How could I
>insert won games into the book?
>
>Jeroen did not have version 12.0 when he wrote the book!

Even Jeroen inserted lines that were untested in his book.
The killerline he played against DIEP he said he didn't even test
whether programs would play the superb h4 idea (sacraficing a pawn).

>    Christophe



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.