Réti+Endgame+Study


 * Home * Engine Testing * Test-Positions * Réti Endgame Study**
 * [[image:http://webchess.freehostia.com/diag/chessdiag.php?fen=7K/8/k1P5/7p/8/8/8/8%20w%20-%20-&size=large&coord=yes&cap=no&stm=yes&fb=no&theme=classic&color1=E3CEAA&color2=635147&color3=000000 caption="7K/8/k1P5/7p/8/8/8/8 w - -"]] ||~ || The **Réti Endgame Study** composed by [|Richard Réti] and published in 1921 in //[|Kagan's Neueste Schachnachrichten]//, 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.

The white king threatens to support his own passer, while simultaneously coming closer to the black passer's pawn square. While the black king will have to spend two tempi to stop the white passer from 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, a too "rough" rule of the square implementation with huge "winning" scores will fail badly here, despite search with transposition table will solve Réti's study quickly, not to mention tablebases. || =Publications=
 * Mikhail Botvinnik (**1993**). //Three Positions//. ICCA Journal, Vol. 16, No. 2
 * Boris Stilman (**1994**). //A Linguistic Geometry of the Chess Model//. Advances in Computer Chess 7, [|pdf draft]

=Forum Posts=
 * [|Re: A Study by Reti] by Garth Courtois Jr., gnu.chess, January 8, 1990
 * [|Reti Endgame study] by Stuart Cracraft, CCC, January 14, 1998
 * [|"The Tale of a Small Tree" by M.M.Botvinnik [fragment]] by José Antônio Fabiano Mendes, CCC, March 09, 2000 » Mikhail Botvinnik

=External Links=
 * [|Réti endgame study from Wikipedia]
 * [|Computer Chess] (Barth, Herbeck)

=References= =What links here?= include component="backlinks" page="Réti Endgame Study" limit="40"
 * Up one level**