Difference between revisions of "Lasker-Reichhelm Position"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * Engine Testing * Test-Positions * Lasker-Reichhelm Position''' {| |- style="vertical-align:top;" | rowspan="2" | The '''Lasker-Reichhelm Posit...")
 
Line 6: Line 6:
 
composed by [https://en.wikipedia.org/wiki/World_chess_champion World Champion] [[Mathematician#EmanuelLasker|Emanuel Lasker]] and Gustavus Charles Reichhelm <ref>[http://www.chessarch.com/museum/draw/01_reichhelm.shtml Gustavus Charles Reichhelm from Chess Archaeology]</ref> in 1901, is most famous to solve with the method of [[Corresponding Squares|corresponding squares]]. It is also a test-position for the efficiency of [[Hash Table#SearchTables|search tables]], most notably the [[Transposition Table|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 [[Transposition Table#ReplacementStrategies|replacement schemes]] purely based on this position.
 
composed by [https://en.wikipedia.org/wiki/World_chess_champion World Champion] [[Mathematician#EmanuelLasker|Emanuel Lasker]] and Gustavus Charles Reichhelm <ref>[http://www.chessarch.com/museum/draw/01_reichhelm.shtml Gustavus Charles Reichhelm from Chess Archaeology]</ref> in 1901, is most famous to solve with the method of [[Corresponding Squares|corresponding squares]]. It is also a test-position for the efficiency of [[Hash Table#SearchTables|search tables]], most notably the [[Transposition Table|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 [[Transposition Table#ReplacementStrategies|replacement schemes]] purely based on this position.
  
−
The Lasker-Reichhelm position, elaborated in 1932 by [https://en.wikipedia.org/wiki/Vitaly_Halberstadt Vitaly Halberstadt] and [[Arts#Duchamp|Marcel Duchamp]] in ''L'opposition et les cases conjuguées sont réconciliées'' (Opposition and Sister Squares are Reconciled) introducing corresponding squares <ref>[https://en.wikipedia.org/wiki/Vitaly_Halberstadt Vitaly Halberstadt] and [[Arts#Duchamp|Marcel Duchamp]] ('''1932'''). ''L'opposition et les cases conjuguées sont réconciliées''.
+
The Lasker-Reichhelm position, elaborated in 1932 by [https://en.wikipedia.org/wiki/Vitaly_Halberstadt Vitaly Halberstadt] and [[:Category:Marcel Duchamp|Marcel Duchamp]] in ''L'opposition et les cases conjuguées sont réconciliées'' (Opposition and Sister Squares are Reconciled) introducing corresponding squares <ref>[https://en.wikipedia.org/wiki/Vitaly_Halberstadt Vitaly Halberstadt], [[:Category:Marcel Duchamp|Marcel Duchamp]] ('''1932'''). ''L'opposition et les cases conjuguées sont réconciliées''.
 
Paris-Brussels 1932, German Edition 2001 ''[http://www.buecher-nach-isbn.info/3-608/3608500359-Opposition-und-Schwesterfelder-Marcel-Duchamp-Vitali-Halberstadt-3-608-50035-9.html Opposition und Schwesterfelder]'', ISBN 3-932170-35-0</ref> , was further mentioned 1941 in [https://en.wikipedia.org/wiki/Reuben_Fine Reuben Fine's] [https://en.wikipedia.org/wiki/Basic_Chess_Endings Basic Chess Endings] and is therefore well known as Fine #70 <ref>[https://en.wikipedia.org/wiki/Reuben_Fine Reuben Fine] ('''1941'''). ''[https://en.wikipedia.org/wiki/Basic_Chess_Endings Basic Chess Endings]''</ref> .  
 
Paris-Brussels 1932, German Edition 2001 ''[http://www.buecher-nach-isbn.info/3-608/3608500359-Opposition-und-Schwesterfelder-Marcel-Duchamp-Vitali-Halberstadt-3-608-50035-9.html Opposition und Schwesterfelder]'', ISBN 3-932170-35-0</ref> , was further mentioned 1941 in [https://en.wikipedia.org/wiki/Reuben_Fine Reuben Fine's] [https://en.wikipedia.org/wiki/Basic_Chess_Endings Basic Chess Endings] and is therefore well known as Fine #70 <ref>[https://en.wikipedia.org/wiki/Reuben_Fine Reuben Fine] ('''1941'''). ''[https://en.wikipedia.org/wiki/Basic_Chess_Endings Basic Chess Endings]''</ref> .  
 
|  <fentt border="double" style="font-size:24pt">8/k7/3p4/p2P1p2/P2P1P2/8/8/K7</fentt>
 
|  <fentt border="double" style="font-size:24pt">8/k7/3p4/p2P1p2/P2P1P2/8/8/K7</fentt>
Line 47: Line 47:
  
 
'''[[Test-Positions|Up one level]]'''
 
'''[[Test-Positions|Up one level]]'''
 +
[[Category:Marcel Duchamp]]

Revision as of 17:37, 14 August 2018

Home * Engine Testing * Test-Positions * Lasker-Reichhelm Position

The Lasker-Reichhelm Position,

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] .

    
    
    
    
    
    
    
    
        
       
       
     
     
        
        
       
        
♚       
   ♟    
♟  ♙ ♟  
♙  ♙ ♙  
        
        
♔       
8/k7/3p4/p2P1p2/P2P1P2/8/8/K7 w - -

See also

Forum Posts

1998 ...

2000 ...

2010 ...

External Links

References

  1. ↑ Gustavus Charles Reichhelm from Chess Archaeology
  2. ↑ Vitaly Halberstadt, Marcel Duchamp (1932). L'opposition et les cases conjuguées sont réconciliées. Paris-Brussels 1932, German Edition 2001 Opposition und Schwesterfelder, ISBN 3-932170-35-0
  3. ↑ Reuben Fine (1941). Basic Chess Endings

Up one level

Retrieved from "https://www.chessprogramming.org/index.php?title=Lasker-Reichhelm_Position&oldid=5903"