The Lasker-Reichhelm Position,
composed by World ChampionEmanuel Lasker and Gustavus Charles Reichhelm [1] 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.
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 [2] , was further mentioned 1941 in Reuben Fine'sBasic Chess Endings and is therefore well known as Fine #70 [3] .
composed by World Champion Emanuel Lasker and Gustavus Charles Reichhelm [1] 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.
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 [2] , was further mentioned 1941 in Reuben Fine's Basic Chess Endings and is therefore well known as Fine #70 [3] .
Table of Contents
See also
Forum Posts
1998 ...
2000 ...
2010 ...
External Links
References
Paris-Brussels 1932, German Edition 2001 Opposition und Schwesterfelder, ISBN 3-932170-35-0
What links here?
Up one level