Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Why not tablebases.

Author: blass uri

Date: 11:09:24 10/10/98

Go up one level in this thread



On October 10, 1998 at 13:23:38, José de Jesús García Ruvalcaba wrote:

>On October 10, 1998 at 01:15:10, blass uri wrote:
>
>>>John, be very careful - it is dangerous to assume anything you can't test or
>>>prove. Have you seen the Savedra position? It is a famous endgame study:
>>>WKg6, WPf6, BKh1, BRe5, White to play. This could arise out of KPPKP.
>>
>>how can it arise practicaly out of KPPKP
>>This could arise only if black promote the pawn to a rook but I see no logical
>>reason to do it when the white pawns are not near the queen square
>>
>>Uri
>>
>
>I think it can not arise in actual play by logical moves. But the machine knows
>no logical moves

The machine can know that doing a rook if you can do a queen and the opponent
has 2 pawns that at least 1 of them can move is not logical
If you tell the machine rules for what is not logical it can use them

Uri

>, it has to calculate everything. And yes, this position can
>appear in the search tree (and it is not too unlikely).



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.