Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Simple Endgame for programs without TBs ??

Author: Bruce Moreland

Date: 17:05:03 11/21/00

Go up one level in this thread


On November 21, 2000 at 18:27:28, Eduard Nemeth wrote:

>[D]8/2K5/1p6/1P4k1/5p2/8/6P1/8 w - - 0 1
>
>Here a correct analysis:
>
>1. Kc6 Kg4 2. Kd6 Kh4 3. Ke6 Kg5 4. Ke5 Kg4 5. Kf6 Kh4 6. Kf5 Kg3 7. Kg5 f3 8.
>gxf3 Kxf3 9. Kf5 ++-
>
>1.Kxb6 is draw.
>
>By me this winning only Fritz, without TBs !
>
>Eduard

This implies that Fritz understand KQ vs KP with an f-pawn.  Understand of this
position used to be included in one of the commonly used test suites, so perhaps
this is why Fritz understands this.

If someone wants to do some Fritz archaeology, they may be interested in
figuring out which version of Fritz introduced this knowledge.

Surely it can't be doing it with search.  It's very easy to take this to
queening, and that's +8 or so.  In order to win for real, you have to prefer the
position with the k-side pawns gone and the white king a ways away from the
q-side pawns.

bruce



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.