Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Selectivity

Author: Christophe Theron

Date: 20:58:41 01/13/01

Go up one level in this thread


On January 13, 2001 at 15:03:01, Uri Blass wrote:

>On January 13, 2001 at 13:38:48, Christophe Theron wrote:
>
>>On January 13, 2001 at 03:17:25, Uri Blass wrote:
>>
>>>On January 12, 2001 at 23:05:23, Christophe Theron wrote:
>>><snipped>
>>>>However I can tell you in advance that you will (probably) discover that Chess
>>>>Tiger and Gambit Tiger are extremely selective. And the next versions will be
>>>>even more selective.
>>>>
>>>>
>>>>
>>>>    Christophe
>>>
>>>
>>>Does it mean that it is not going to find a4 at smaller depth?
>>>
>>>Uri
>>
>>
>>
>>I don't care about finding a4. I don't care about solving test suites faster.
>>
>>I do care about playing stronger, and it's a different story.
>>
>>
>>
>>    Christophe
>
>Basically the stories are similiar and in most of the cases the better program
>in playing games is also better in solving test suites.
>
>Uri


I think you are right. But if my program gets better at solving test suites, it
will be because I'm trying to make it stronger in real games.

That's why I don't care about finding a4 in this position.



    Christophe



This page took 0.01 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.