Jesper Torp Kristensen

Home * People * Jesper Torp Kristensen



Jesper Torp Kristensen, a Danish computer scientist affiliated with Issuu. He holds a master degree from the Department of Computer Science, Aarhus University under supervision of Peter Bro Miltersen on the topic of generation and compression of endgame tablebases in chess. Applying ordered binary decision diagrams (OBDDs), the objective was to maximize the number of endgame combinations that can be stored in RAM, while still being able to access the tables fast enough to be used during full depth searches.

=Quotes= Kristensen's work was recognized by Ronald de Man as used to compress his Syzygy Bases - quote from a reply to Guy Haworth, April 06, 2013 I create tables in RAM that have all the information necessary for WDL50+ and DTZ50+, then permute them to different indexing schemes and compress. I do test runs on subsets of the data to find good permutations. (The idea to try permutations is from Jesper Torp Kristensen's master thesis. =Selected Publications=
 * Jesper Torp Kristensen (2005). Generation and compression of endgame tables in chess with fast random access using OBDDs. Master thesis, supervisor Peter Bro Miltersen, Aarhus University
 * Jesper Torp Kristensen, Peter Bro Miltersen (2006). Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard. COCOON 2006

=External Links=
 * Jesper Torp Kristensen - Issuu
 * doktoren (Jesper Torp Kristensen) · GitHub
 * GitHub - doktoren/chess-cpp: Source code for the program made in the master thesis: Generation and compression of endgame tables in chess with fast random access using OBDDs

=References= Up one level