Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: an evaluation problem of chess programs

Author: blass uri

Date: 12:23:11 10/02/98

Go up one level in this thread



On October 02, 1998 at 13:12:02, Robert Hyatt wrote:

>
>In this position. crafty says Be4+ Mat34, with a 2 second search.  How did
>it do that?  like this:
>
>                8     2.03  Mat34   1. Be4+ Ka7 2. Bxb8+ Ka6 3. Bb7+ Qxb7
>                                    4. Rxb7 Kxb7
>                8->   3.27  Mat34   1. Be4+ Ka7 2. Bxb8+ Ka6 3. Bb7+ Qxb7
>                                    4. Rxb7 Kxb7
>
>What it did was to search deeply enough to see that it could trade bishop
>and rook for the opponent's rook and queen, leaving it in a KBN vs K position.
>And after searching the 8 plies into the future (as it did above) it then found
>the endgame database position and said "aha, Mate in N from this point."


>
>This is why my current version (15.21) won't play Rxb2, because it can see
>deeply enough into the future to see the white king eating the black pawns
>and that gives "mate in N".

If it could see this then without tablebases the evaluation was instead of -0.xx
big advantage for white because it could not see the mate but could see the
position of KPP against K

 Or in some variations it sees one black and one
>white pawn being traded, and that also leads to mate in N.

I do not think that there are logical lines to go to KP against KP in the
example that I gave



Uri



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.