25,161
edits
Changes
Created page with "'''Home * People * Heiner Marxen''' FILE:HeinerMarxen.jpg|border|right|thumb|link=http://www.quarkchess.de/belct/body_index.html|240px| Heiner Marxen at [..."
'''[[Main Page|Home]] * [[People]] * Heiner Marxen'''
[[FILE:HeinerMarxen.jpg|border|right|thumb|link=http://www.quarkchess.de/belct/body_index.html|240px| Heiner Marxen at [[BELCT 2001]] <ref>[http://www.quarkchess.de/belct/ BELCT 2001 Berlin is worth a trip !] photos by [[Thomas Mayer]]</ref> ]]
'''Heiner Marxen''',<br/>
a German computer scientist and software engineer, M.Sc. in computer science from [https://en.wikipedia.org/wiki/Technical_University_of_Berlin Technical University of Berlin] in 1986, and author of [[Chest]], a Program for Solving Orthodox [[Chess Problems, Compositions and Studies|Chess Problems]] <ref>[http://turbotm.de/~heiner/Chess/chest.html Chest: A Program for Solving Orthodox Chess Problems]</ref>.
Heiner is a well known [https://en.wikipedia.org/wiki/Busy_beaver Busy Beaver] expert <ref>[http://turbotm.de/~heiner/BB/index.html Heiner Marxen - Busy Beaver]</ref>.
Additionally he introduced a method to compute [http://www.iwriteiam.nl/Crook_path.html Rook Paths Puzzles] <ref>[http://turbotm.de/~heiner/Rookpath/method.html Heiner Marxen's Method to compute the Rook Paths Puzzle]</ref>.
In 1973, he has written the first precursor of Chest, written in [[Fortran|Fortran-II]] (no [[Recursion|recursion]]) to solve [https://en.wikipedia.org/wiki/Chess_problem#Types_of_problem mate-in-two problems] <ref>[http://turbotm.de/~heiner/Chess/chest.html CHEST: A Program for Solving Orthodox Chess Problems]</ref>.
It did not need or use any tapes and ran on an [https://en.wikipedia.org/wiki/IBM_1130 IBM-1130] with 32 K bytes, and took half an hour for one job <ref>[http://www.talkchess.com/forum3/viewtopic.php?f=7&t=41373&start=5 Re: Perft(3) from 1978, with a twist!] by [[Heiner Marxen]], [[CCC]], December 09, 2011</ref>.
=Selected Publications=
<ref>[https://dblp.org/pid/02/4081.html dblp: Heiner Marxen]</ref>
* [[Heiner Marxen]], Jürgen Buntrock ('''1990'''). ''[http://turbotm.de/~heiner/BB/mabu90.html Attacking the Busy Beaver 5]''. [https://en.wikipedia.org/wiki/European_Association_for_Theoretical_Computer_Science#EATCS_Bulletin Bulletin of the EATCS], Vol. 40
* Roland Mueller, H.D. Doll, I.J. Donasch, [[Heiner Marxen]], H. Pause ('''1991'''). ''[https://ieeexplore.ieee.org/document/164617 A new man-machine-interface at BESSY]''. [[IEEE|IEEE]] Conference on Particle Accelerator <ref>[https://en.wikipedia.org/wiki/BESSY BESSY from Wikipedia]</ref>
=Forum Posts=
==1997 ...==
* [https://groups.google.com/g/rec.games.chess.computer/c/qJXhpVJPgVg/m/iMY_9-IcK5kJ New improvement to alpha/beta + TT?] by [[Heiner Marxen]], [[Computer Chess Forums|rgcc]], January 13, 1997 » [[Fail-Soft]]
* [https://www.stmintz.com/ccc/index.php?id=54279 Null move idea] by [[Heiner Marxen]], [[CCC]], June 04, 1999 » [[Null Move Pruning]]
* [https://www.stmintz.com/ccc/index.php?id=83247 CHEST 3.19 is available] by [[Heiner Marxen]], [[CCC]], December 18, 1999
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=192968 Nalimov's EGTBs (long post with code)] by [[Heiner Marxen]], [[CCC]], October 13, 2001 » [[Nalimov Tablebases]]
* [https://www.stmintz.com/ccc/index.php?id=233270 A new(?) technique to recognize draws] by [[Heiner Marxen]], [[CCC]], June 01, 2002 » [[Repetitions]], [[Corresponding Squares]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=14860&start=12 Re: Delaying Extensions Idea (does anyone do this)?] by [[Heiner Marxen]], [[CCC]], July 24, 2007 » [[Extensions]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=23498&start=7 Re: Piece List questions] by [[Heiner Marxen]], [[CCC]], September 05, 2008 » [[Piece-Lists]]
==2010 ...==
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=40481&start=38 Re: How old were you in 1967??] by [[Heiner Marxen]], [[CCC]], September 21, 2011
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=41373&start=5 Re: Perft(3) from 1978, with a twist!] by [[Heiner Marxen]], [[CCC]], December 09, 2011 » [[Perft]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=42677&start=2 Re: Counting depth as a function of number of legal moves] by [[Heiner Marxen]], [[CCC]], February 29, 2012
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=44185&start=2 Re: Wanted: A successor to Chest] by [[Heiner Marxen]], [[CCC]], June 25, 2012
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=52085&start=1 Re: Incrementally-updated attack map] by [[Heiner Marxen]], [[CCC]], April 22, 2014 » [[Incremental Updates]], [[Attack and Defend Maps]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=56225&start=35 Re: A simple PRNG using /dev/urandom] by [[Heiner Marxen]], [[CCC]], May 07, 2015 » [[Pseudorandom Number Generator|PRNG]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=57228&start=13 Re: Move ordering for cheapest refutation] by [[Heiner Marxen]], [[CCC]], August 13, 2015 » [[Move Ordering]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=63330&start=21 Re: What should the next step be ?] by [[Heiner Marxen]], [[CCC]], May 18, 2017
=External Links=
* [http://turbotm.de/~heiner/ Home Page of Heiner Marxen]
* [http://turbotm.de/~heiner/Chess/index.html Solving Orthodox Chess Problems]
* [http://turbotm.de/~heiner/Rookpath/index.html Self-Avoiding Walks of a Rook on a Chessboard]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Marxen]]
[[FILE:HeinerMarxen.jpg|border|right|thumb|link=http://www.quarkchess.de/belct/body_index.html|240px| Heiner Marxen at [[BELCT 2001]] <ref>[http://www.quarkchess.de/belct/ BELCT 2001 Berlin is worth a trip !] photos by [[Thomas Mayer]]</ref> ]]
'''Heiner Marxen''',<br/>
a German computer scientist and software engineer, M.Sc. in computer science from [https://en.wikipedia.org/wiki/Technical_University_of_Berlin Technical University of Berlin] in 1986, and author of [[Chest]], a Program for Solving Orthodox [[Chess Problems, Compositions and Studies|Chess Problems]] <ref>[http://turbotm.de/~heiner/Chess/chest.html Chest: A Program for Solving Orthodox Chess Problems]</ref>.
Heiner is a well known [https://en.wikipedia.org/wiki/Busy_beaver Busy Beaver] expert <ref>[http://turbotm.de/~heiner/BB/index.html Heiner Marxen - Busy Beaver]</ref>.
Additionally he introduced a method to compute [http://www.iwriteiam.nl/Crook_path.html Rook Paths Puzzles] <ref>[http://turbotm.de/~heiner/Rookpath/method.html Heiner Marxen's Method to compute the Rook Paths Puzzle]</ref>.
In 1973, he has written the first precursor of Chest, written in [[Fortran|Fortran-II]] (no [[Recursion|recursion]]) to solve [https://en.wikipedia.org/wiki/Chess_problem#Types_of_problem mate-in-two problems] <ref>[http://turbotm.de/~heiner/Chess/chest.html CHEST: A Program for Solving Orthodox Chess Problems]</ref>.
It did not need or use any tapes and ran on an [https://en.wikipedia.org/wiki/IBM_1130 IBM-1130] with 32 K bytes, and took half an hour for one job <ref>[http://www.talkchess.com/forum3/viewtopic.php?f=7&t=41373&start=5 Re: Perft(3) from 1978, with a twist!] by [[Heiner Marxen]], [[CCC]], December 09, 2011</ref>.
=Selected Publications=
<ref>[https://dblp.org/pid/02/4081.html dblp: Heiner Marxen]</ref>
* [[Heiner Marxen]], Jürgen Buntrock ('''1990'''). ''[http://turbotm.de/~heiner/BB/mabu90.html Attacking the Busy Beaver 5]''. [https://en.wikipedia.org/wiki/European_Association_for_Theoretical_Computer_Science#EATCS_Bulletin Bulletin of the EATCS], Vol. 40
* Roland Mueller, H.D. Doll, I.J. Donasch, [[Heiner Marxen]], H. Pause ('''1991'''). ''[https://ieeexplore.ieee.org/document/164617 A new man-machine-interface at BESSY]''. [[IEEE|IEEE]] Conference on Particle Accelerator <ref>[https://en.wikipedia.org/wiki/BESSY BESSY from Wikipedia]</ref>
=Forum Posts=
==1997 ...==
* [https://groups.google.com/g/rec.games.chess.computer/c/qJXhpVJPgVg/m/iMY_9-IcK5kJ New improvement to alpha/beta + TT?] by [[Heiner Marxen]], [[Computer Chess Forums|rgcc]], January 13, 1997 » [[Fail-Soft]]
* [https://www.stmintz.com/ccc/index.php?id=54279 Null move idea] by [[Heiner Marxen]], [[CCC]], June 04, 1999 » [[Null Move Pruning]]
* [https://www.stmintz.com/ccc/index.php?id=83247 CHEST 3.19 is available] by [[Heiner Marxen]], [[CCC]], December 18, 1999
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=192968 Nalimov's EGTBs (long post with code)] by [[Heiner Marxen]], [[CCC]], October 13, 2001 » [[Nalimov Tablebases]]
* [https://www.stmintz.com/ccc/index.php?id=233270 A new(?) technique to recognize draws] by [[Heiner Marxen]], [[CCC]], June 01, 2002 » [[Repetitions]], [[Corresponding Squares]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=14860&start=12 Re: Delaying Extensions Idea (does anyone do this)?] by [[Heiner Marxen]], [[CCC]], July 24, 2007 » [[Extensions]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=23498&start=7 Re: Piece List questions] by [[Heiner Marxen]], [[CCC]], September 05, 2008 » [[Piece-Lists]]
==2010 ...==
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=40481&start=38 Re: How old were you in 1967??] by [[Heiner Marxen]], [[CCC]], September 21, 2011
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=41373&start=5 Re: Perft(3) from 1978, with a twist!] by [[Heiner Marxen]], [[CCC]], December 09, 2011 » [[Perft]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=42677&start=2 Re: Counting depth as a function of number of legal moves] by [[Heiner Marxen]], [[CCC]], February 29, 2012
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=44185&start=2 Re: Wanted: A successor to Chest] by [[Heiner Marxen]], [[CCC]], June 25, 2012
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=52085&start=1 Re: Incrementally-updated attack map] by [[Heiner Marxen]], [[CCC]], April 22, 2014 » [[Incremental Updates]], [[Attack and Defend Maps]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=56225&start=35 Re: A simple PRNG using /dev/urandom] by [[Heiner Marxen]], [[CCC]], May 07, 2015 » [[Pseudorandom Number Generator|PRNG]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=57228&start=13 Re: Move ordering for cheapest refutation] by [[Heiner Marxen]], [[CCC]], August 13, 2015 » [[Move Ordering]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=63330&start=21 Re: What should the next step be ?] by [[Heiner Marxen]], [[CCC]], May 18, 2017
=External Links=
* [http://turbotm.de/~heiner/ Home Page of Heiner Marxen]
* [http://turbotm.de/~heiner/Chess/index.html Solving Orthodox Chess Problems]
* [http://turbotm.de/~heiner/Rookpath/index.html Self-Avoiding Walks of a Rook on a Chessboard]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Marxen]]
