Jesper+Torp+Kristensen

a Danish computer scientist working at [|Issuu]. He holds a M.Sc. 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], 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. || toc =Selected Publications=
 * Home * People * Jesper Torp Kristensen**
 * [[image:JesperKristensen.jpg link="http://www.linkedin.com/pub/jesper-kristensen/1/936/678"]] ||~ || **Jesper Torp Kristensen**,
 * Jesper Kristensen ||~ ||^ ||
 * 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], [|pdf]
 * Jesper Torp Kristensen, Peter Bro Miltersen (**2006**). //[|Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard]//. [|COCOON 2006]

=External Links= > [|doktoren/chess-cpp · GitHub]
 * [|Jesper TK's home page]
 * [|Jesper Kristensen | LinkedIn]
 * [|doktoren (Jesper Torp Kristensen) · GitHub]

=References= =What links here?= include page="Jesper Torp Kristensen" component="backlinks" limit="40"
 * Up one level**