Author: Christophe Theron
Date: 13:59:14 12/12/01
Go up one level in this thread
On December 12, 2001 at 16:25:26, Uri Blass wrote:
>On December 12, 2001 at 15:52:58, Christophe Theron wrote:
>
>>On December 12, 2001 at 14:25:34, Uri Blass wrote:
>>
>>>On December 12, 2001 at 13:43:17, Christophe Theron wrote:
>>>
>>>>On December 12, 2001 at 03:17:30, Uri Blass wrote:
>>>>
>>>>>My guess is that a piece square table program with good search rules can get
>>>>>2200-2300 ssdf rating on A1200
>>>>
>>>>
>>>>
>>>>Much more than that. At least 2400 SSDF elo.
>>>>
>>>>
>>>>
>>>> Christophe
>>>
>>>It may be interesting if you can release also an engine with only piece square
>>>table evaluation.
>>
>>
>>
>>I am sorry, I would be interested in the experiment but unfortunately I have too
>>many things to do...
>>
>>
>>
>>
>>>I am not talking about relative simple evaluation like the idea to check gerbil.
>>>Gerbil is not optimized for speed and it has not optimal search rules.
>>>Gerbil also does not use only piece square table evaluation.
>>>
>>>I am also talking about tournament time control and I suspect that piece square
>>>table program is going to earn less from time.
>>>
>>>I believe that the 2400 can be correct for blitz.
>>>
>>>I know that your opinion is that only the branching factor is important here
>>>and it may be interesting if you release an engine with only piece square table
>>>evaluation so people can test it.
>>
>>
>>
>>My opinion is not that only the branching factor is important.
>>
>>It is clear that a PST-only program will suffer from lack of deep positional
>>understanding (because the weights in the table are only updated by looking at
>>the root position), but not as much as one would fear.
>
>I admit that I thought about a static piece square table.
>
>I think that the question is basically 2 different questions:
>1)what is the rating that can be achieved when the program is using only one
>piece square table (the same table in all positions)?
>
>2)What is the rating that the program can get when it is using a dynamic piece
>square table that can be changed only when you look at the root?
>
>Uri
The one that has a PST updated at each root position will be significantly
stronger. Probably 50 to 70 elo stronger.
This is going to be obvious in the endgame for example.
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.