Difference between revisions of "Lasker-Reichhelm Position"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
'''[[Main Page|Home]] * [[Engine Testing]] * [[Test-Positions]] * Lasker-Reichhelm Position''' | '''[[Main Page|Home]] * [[Engine Testing]] * [[Test-Positions]] * Lasker-Reichhelm Position''' | ||
| − | + | [[FILE:Lasker-Reichhelm position.jpg|right|thumb| 8/k7/3p4/p2P1p2/P2P1P2/8/8/K7 w - - <ref>Lasker-Reichhelm Position, as described in 1932 treatise ''L'opposition et cases conjuguées sont réconciliées'' (Opposition and Sister Squares are Reconciled) by [https://en.wikipedia.org/wiki/Vitaly_Halberstadt Vitaly Halberstadt] and [[:Category:Marcel Duchamp|Marcel Duchamp]], introducing [[Corresponding Squares]]</ref> ]] | |
| − | |- | + | |
| − | + | The '''Lasker-Reichhelm Position''', <br/> | |
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 [[: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''. | 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> . | ||
| − | + | ||
| − | |||
| − | |||
| − | |||
=See also= | =See also= | ||
| Line 37: | Line 34: | ||
* [http://www.talkchess.com/forum/viewtopic.php?t=36636 fine #70 revisited] by [[Robert Hyatt]], [[CCC]], November 08, 2010 | * [http://www.talkchess.com/forum/viewtopic.php?t=36636 fine #70 revisited] by [[Robert Hyatt]], [[CCC]], November 08, 2010 | ||
* [http://www.talkchess.com/forum/viewtopic.php?t=57845 Position #70 from Fine's _Basic Chess Endings_] by [[Steven Edwards]], [[CCC]], October 05, 2015 | * [http://www.talkchess.com/forum/viewtopic.php?t=57845 Position #70 from Fine's _Basic Chess Endings_] by [[Steven Edwards]], [[CCC]], October 05, 2015 | ||
| − | * [http://www.talkchess.com/forum/viewtopic.php?t=60769 Is there a "correct" mate score for Fine#70?] by Vincent Tang, [[CCC]], July 10, 2016 | + | * [http://www.talkchess.com/forum/viewtopic.php?t=60769 Is there a "correct" mate score for Fine#70?] by [[Vincent Tang]], [[CCC]], July 10, 2016 |
| − | * [http://www.talkchess.com/forum/viewtopic.php?t=65526 Transposition table and Fine#70] by Vincent Tang, [[CCC]], October 23, 2017 | + | * [http://www.talkchess.com/forum/viewtopic.php?t=65526 Transposition table and Fine#70] by [[Vincent Tang]], [[CCC]], October 23, 2017 |
| + | * [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=69889 Strange draw scores when searching Fine#70] by [[Vincent Tang]], [[CCC]], February 12, 2019 | ||
=External Links= | =External Links= | ||
Latest revision as of 21:18, 2 March 2020
Home * Engine Testing * Test-Positions * Lasker-Reichhelm Position
8/k7/3p4/p2P1p2/P2P1P2/8/8/K7 w - - [1]
The Lasker-Reichhelm Position,
composed by World Champion Emanuel Lasker and Gustavus Charles Reichhelm [2] 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 [3] , was further mentioned 1941 in Reuben Fine's Basic Chess Endings and is therefore well known as Fine #70 [4] .
Contents
See also
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
- Strange draw scores when searching Fine#70 by Vincent Tang, CCC, February 12, 2019
External Links
References
- ↑ Lasker-Reichhelm Position, as described in 1932 treatise L'opposition et cases conjuguées sont réconciliées (Opposition and Sister Squares are Reconciled) by Vitaly Halberstadt and Marcel Duchamp, introducing Corresponding Squares
- ↑ Gustavus Charles Reichhelm from Chess Archaeology
- ↑ 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
- ↑ Reuben Fine (1941). Basic Chess Endings
