Difference between revisions of "Heiner Marxen"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) m |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
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>. | 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>. | 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>. | + | Additionally he introduced a method to compute [https://en.wikipedia.org/wiki/Rook%27s_graph Rook Paths Puzzles] <ref>[http://www.iwriteiam.nl/Crook_path.html Rook Paths Puzzles]</ref> <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 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>. | In 1973, he has written the first precursor of Chest 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>. | 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>. | ||
| Line 13: | Line 13: | ||
<ref>[https://dblp.org/pid/02/4081.html dblp: Heiner Marxen]</ref> | <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 | * [[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]], | + | * Roland Mueller, H.D. Doll, I.J. Donasch, [[Heiner Marxen]], [[Holger 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= | =Forum Posts= | ||
Latest revision as of 18:21, 14 November 2020
Heiner Marxen,
a German computer scientist and software engineer, M.Sc. in computer science from Technical University of Berlin in 1986, and author of Chest, a Program for Solving Orthodox Chess Problems [2].
Heiner is a well known Busy Beaver expert [3].
Additionally he introduced a method to compute Rook Paths Puzzles [4] [5].
In 1973, he has written the first precursor of Chest in Fortran-II (no recursion) to solve mate-in-two problems [6].
It did not need or use any tapes and ran on an IBM-1130 with 32 K bytes, and took half an hour for one job [7].
Contents
Selected Publications
- Heiner Marxen, Jürgen Buntrock (1990). Attacking the Busy Beaver 5. Bulletin of the EATCS, Vol. 40
- Roland Mueller, H.D. Doll, I.J. Donasch, Heiner Marxen, Holger Pause (1991). A new man-machine-interface at BESSY. IEEE Conference on Particle Accelerator [9]
Forum Posts
1997 ...
- New improvement to alpha/beta + TT? by Heiner Marxen, rgcc, January 13, 1997 » Fail-Soft
- Null move idea by Heiner Marxen, CCC, June 04, 1999 » Null Move Pruning
- CHEST 3.19 is available by Heiner Marxen, CCC, December 18, 1999
2000 ...
- Nalimov's EGTBs (long post with code) by Heiner Marxen, CCC, October 13, 2001 » Nalimov Tablebases
- A new(?) technique to recognize draws by Heiner Marxen, CCC, June 01, 2002 » Repetitions, Corresponding Squares
- Re: Delaying Extensions Idea (does anyone do this)? by Heiner Marxen, CCC, July 24, 2007 » Extensions
- Re: Piece List questions by Heiner Marxen, CCC, September 05, 2008 » Piece-Lists
2010 ...
- Re: How old were you in 1967?? by Heiner Marxen, CCC, September 21, 2011
- Re: Perft(3) from 1978, with a twist! by Heiner Marxen, CCC, December 09, 2011 » Perft
- Re: Counting depth as a function of number of legal moves by Heiner Marxen, CCC, February 29, 2012
- Re: Wanted: A successor to Chest by Heiner Marxen, CCC, June 25, 2012
- Re: Incrementally-updated attack map by Heiner Marxen, CCC, April 22, 2014 » Incremental Updates, Attack and Defend Maps
- Re: A simple PRNG using /dev/urandom by Heiner Marxen, CCC, May 07, 2015 » PRNG
- Re: Move ordering for cheapest refutation by Heiner Marxen, CCC, August 13, 2015 » Move Ordering
- Re: What should the next step be ? by Heiner Marxen, CCC, May 18, 2017
External Links
- Home Page of Heiner Marxen
- Solving Orthodox Chess Problems
- Self-Avoiding Walks of a Rook on a Chessboard
References
- ↑ BELCT 2001 Berlin is worth a trip ! photos by Thomas Mayer
- ↑ Chest: A Program for Solving Orthodox Chess Problems
- ↑ Heiner Marxen - Busy Beaver
- ↑ Rook Paths Puzzles
- ↑ Heiner Marxen's Method to compute the Rook Paths Puzzle
- ↑ CHEST: A Program for Solving Orthodox Chess Problems
- ↑ Re: Perft(3) from 1978, with a twist! by Heiner Marxen, CCC, December 09, 2011
- ↑ dblp: Heiner Marxen
- ↑ BESSY from Wikipedia
