Changes

Jump to: navigation, search

Réti Endgame Study

3,104 bytes added, 20:18, 15 May 2018
Created page with "'''Home * Engine Testing * Test-Positions * Réti Endgame Study''' {| |- style="vertical-align:top;" | rowspan="2" | The '''Réti Endgame Study''',<br/..."
'''[[Main Page|Home]] * [[Engine Testing]] * [[Test-Positions]] * Réti Endgame Study'''

{|
|- style="vertical-align:top;"
| rowspan="2" | The '''Réti Endgame Study''',<br/>
composed by [https://en.wikipedia.org/wiki/Richard_R%C3%A9ti Richard Réti] and published in 1921 in ''[https://en.wikipedia.org/wiki/Bernhard_Kagan Kagan's Neueste Schachnachrichten]'' <ref>[https://en.wikipedia.org/wiki/R%C3%A9ti_endgame_study Réti endgame study from Wikipedia]</ref>, demonstrates how a king can make multiple threats, and how it can take more than one path to a given location with the same number of moves. White to move and draw!

At the first glance it seems that White has no hope. His king is far [[Rule of the Square|outside the square]] of the black pawn and further has a long way from supporting his own pawn with the opponent king inside its square.

But the white king threatens to support his own [[Passed Pawn|passer]], while simultaneously coming closer to the black passer's pawn square. While the black king will have to spend two [[Tempo|tempi]] to stop the white passer from [[Promotions|queening]], this is the number of tempi the white king needs to gain in order to get into the square of the black passer.

Inside a chess program's [[Evaluation|evaluation]], a too "rough" [[Rule of the Square|rule of the square]] implementation with huge "winning" scores will fail badly here, despite [[Search|search]] with [[Transposition Table|transposition table]] will solve Réti's study quickly, not to mention [[Endgame Tablebases|tablebases]].
| <fentt border="double" style="font-size:24pt">7K/8/k1P5/7p/8/8/8/8</fentt>
|-
| 7K/8/k1P5/7p/8/8/8/8 w - -
|}

=Publications=
* [[Mikhail Botvinnik]] ('''1993'''). ''Three Positions''. [[ICGA Journal#16_2|ICCA Journal, Vol. 16, No. 2]] <ref>[https://www.stmintz.com/ccc/index.php?id=101063 "The Tale of a Small Tree" by M.M.Botvinnik [fragment]] by [[José Antônio Fabiano Mendes]], [[CCC]], March 09, 2000</ref>
* [[Boris Stilman]] ('''1994'''). ''A Linguistic Geometry of the Chess Model''. [[Advances in Computer Chess 7]], [http://www.stilman-strategies.com/bstilman/boris_papers/Jour94_CHESS7.pdf pdf draft]

=Forum Posts=
* [http://groups.google.com/group/gnu.chess/browse_frm/thread/8d9bacfc18a2fb51 Re: A Study by Reti] by [[Garth Courtois Jr.]], [[GNU Chess#NewsGroup|gnu.chess]], January 8, 1990
* [https://www.stmintz.com/ccc/index.php?id=14083 Reti Endgame study] by [[Stuart Cracraft]], [[CCC]], January 14, 1998
* [https://www.stmintz.com/ccc/index.php?id=101063 "The Tale of a Small Tree" by M.M.Botvinnik [fragment]] by [[José Antônio Fabiano Mendes]], [[CCC]], March 09, 2000 » [[Mikhail Botvinnik]] <ref>[[Mikhail Botvinnik]] ('''1993'''). ''Three Positions''. [[ICGA Journal#16_2|ICCA Journal, Vol. 16, No. 2]]</ref>

=External Links=
* [https://en.wikipedia.org/wiki/R%C3%A9ti_endgame_study Réti endgame study from Wikipedia]
* [http://www.ads.tuwien.ac.at/research/Chess.html Computer Chess] ([[Wilhelm Barth|Barth]], [[Heinz Herbeck|Herbeck]])

=References=
<references />

'''[[Test-Positions|Up one level]]'''

Navigation menu