Jesper Torp Kristensen, a Danish computer scientist working at Issuu [1]. He holds a M.Sc. degree from the Department of Computer Science, Aarhus University [2] under supervision of Peter Bro Miltersen on the topic of generation and compression of endgame tablebases in chess [3]. 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.
Jesper Kristensen [4]

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, pdf
• Jesper Torp Kristensen, Peter Bro Miltersen (2006). Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard. COCOON 2006

External Links

• Jesper TK's home page
• Jesper Kristensen | LinkedIn
• doktoren (Jesper Torp Kristensen) · GitHub
  doktoren/chess-cpp · GitHub

References

1. ^ CV for Jesper Torp Kristensen
2. ^ Daimi: Computer Science in Aarhus (Datalogi)
3. ^ Compression of endgame tables in chess
4. ^ Jesper Kristensen | LinkedIn
5. ^ dblp: Jesper Torp Kristensen

What links here?