25,161
edits
Changes
no edit summary
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>.
