Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: an evaluation problem of chess programs

Author: blass uri

Date: 06:19:40 10/02/98

Go up one level in this thread



On October 02, 1998 at 08:35:58, Robert Hyatt wrote:

>On October 02, 1998 at 02:06:33, blass uri wrote:
>
>>
>>On October 02, 1998 at 02:03:05, blass uri wrote:
>>
>>
>>>I understand that tablebases can help to see long mates(instead of material
>>>evaluation of 2 pawns advantage) but I do not understand how can they help in
>>>the original position because the static evaluation without hash tables
>>
>>I mean without tablebases
>>
>>Uri
>
>
>because the positions after rxb2 are lost for black, while the starting
>position is -1.something...  I'm not sure what it is you don't understand.
>The tablebases provide -MatNN, +MatNN and Draw scores...  and this has
>nothing to do with the static evaluation of the position.  A tablebase
>hit overrides *any* score.

I understand that tablebases provide -MatNN,+MAtNN and draw scores
but I do not understand how can you go to positions that you use tablebases
at depth 12 from the initial position because tablebases are for KPP against K
or KP against KP and not for positions with more pieces.
You need to calculate more than 16 plies to go to positions that you can
use tablebases if you do not do special extensions in pawn endings.

I thought that If you can see by tablebases that the position is -MatNN because
it is KPP against K then you can see without tablebases that the position is not
-0.xx because the static evaluation function without tablebases is not -0.xx

Uri



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.