Lasker-Reichhelm+Position

composed by [|World Champion] Emanuel Lasker and Gustavus Charles Reichhelm in 1901, is most famous to solve with the method of corresponding squares. It is also a test-position for the efficiency of search tables, most notably the transposition table, where most of today's programs find the only winning move Kb1 with an appropriate (winning) score in less than one second. However, it is not recommended to tune replacement schemes purely based on this position.
 * Home * Engine Testing * Test-Positions * Lasker-Reichhelm Position**
 * [[image:http://webchess.freehostia.com/diag/chessdiag.php?fen=8/k7/3p4/p2P1p2/P2P1P2/8/8/K7%20w%20-%20-&size=large&coord=yes&cap=no&stm=no&fb=no&theme=classic&color1=E3CEAA&color2=635147&color3=000000 caption="8/k7/3p4/p2P1p2/P2P1P2/8/8/K7 w - -"]] ||~  || The **Lasker-Reichhelm Position**,

The Lasker-Reichhelm position, elaborated in 1932 by [|Vitaly Halberstadt] and Marcel Duchamp in //L'opposition et les cases conjuguées sont réconciliées// (Opposition and Sister Squares are Reconciled) introducing corresponding squares, was further mentioned 1941 in [|Reuben Fine's] [|Basic Chess Endings] and is therefore well known as Fine #70. || toc =See also=
 * Corresponding Squares
 * Peasant
 * Transposition Table

=Forum Posts=

1998 ...

 * [|Fine 70 hashing litmus test (was Re: Rehashing)] by Stuart Cracraft, CCC, January 23, 1998

2000 ...

 * [|Yet again: Hashing and FINE 70] by Tim Foden, CCC, December 18, 2000
 * [|chess program "Wilhelm" released] by Rafael B. Andrist, CCC, August 19, 2001
 * [|Re: Fine 70 same 7 engines (more)] by Rafael B. Andrist, CCC, September 10, 2001
 * [|Re: Verified Null-Move Pruning, ICGA 25(3)] by Frank Phillips, CCC, November 27, 2002 » Verified Null-Move Pruning
 * [|BigLion and fine 70] by Sune Fischer, Winboard Forum, December 09, 2002 » BigLion
 * [|How much ply should FINE #70 be solved?] by Michel Langeveld, CCC, July 02, 2003
 * [|Problem with TT] by Grzegorz Sidorowicz, CCC, July 11, 2003
 * [|Fine #70] by Michel Langeveld, CCC, October 15, 2003
 * [|Fine #70 and hash bug(s) (warning: long post)] by Andrew Wagner, CCC, April 18, 2004
 * [|Interpreting my analysis of the Fine 70 position] by Eric Oldre, CCC, July 11, 2004
 * [|fine #70] by Jan K., CCC, August 12, 2004
 * [|Amazing, Fruit 2 needs several mins to solve Fine 70] by Ross Boyd, CCC, March 17, 2005

2010 ...

 * [|fine #70 revisited] by Robert Hyatt, CCC, November 08, 2010
 * [|Position #70 from Fine's _Basic Chess Endings_] by Steven Edwards, CCC, October 05, 2015
 * [|Is there a "correct" mate score for Fine#70?] by Vincent Tang, CCC, July 10, 2016
 * [|Transposition table and Fine#70] by Vincent Tang, CCC, October 23, 2017

=External Links=
 * [|Lasker-Reichhelm position from Wikipedia]

=References= =What links here?= include component="backlinks" page="Lasker-Reichhelm Position" limit="40"
 * Up one level**