25,161
edits
Changes
Created page with "'''Home * People * Jesper Torp Kristensen''' FILE:JesperKristensen.jpg|border|right|thumb|link=https://github.com/doktoren| Jesper Kristensen <ref>[https:..."
'''[[Main Page|Home]] * [[People]] * Jesper Torp Kristensen'''
[[FILE:JesperKristensen.jpg|border|right|thumb|link=https://github.com/doktoren| Jesper Kristensen <ref>[https://github.com/doktoren doktoren (Jesper Torp Kristensen) · GitHub]</ref> ]]
'''Jesper Torp Kristensen''',<br/>
a Danish computer scientist affiliated with [https://en.wikipedia.org/wiki/Issuu Issuu] <ref>[https://issuu.com/jespertk Jesper Torp Kristensen - Issuu]</ref>.
He holds a master degree from the Department of Computer Science, [https://en.wikipedia.org/wiki/Aarhus_University Aarhus University] under supervision of [[Mathematician#Miltersen|Peter Bro Miltersen]] on the topic of [[Retrograde Analysis|generation]] and compression of [[Endgame Tablebases|endgame tablebases]] in chess <ref>[[Jesper Torp Kristensen]] ('''2005'''). ''[https://issuu.com/jespertk/docs/master_thesis Generation and compression of endgame tables in chess with fast random access using OBDDs]''. Master thesis, supervisor [[Mathematician#Miltersen|Peter Bro Miltersen]], [https://en.wikipedia.org/wiki/Aarhus_University Aarhus University]</ref>. Applying [https://en.wikipedia.org/wiki/Binary_decision_diagram ordered binary decision diagrams] (OBDDs), the objective was to maximize the number of endgame combinations that can be stored in [[Memory#RAM|RAM]], while still being able to access the tables fast enough to be used during full [[Depth|depth]] [[Search|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 <ref>[http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=6971&start=6 Re: New 6-piece tablebase generator] by [[Ronald de Man|syzygy]], [[Computer Chess Forums|CCRL Discussion Board]], April 06, 2013</ref>
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|Jesper Torp Kristensen's]] master thesis.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/k/Kristensen:Jesper_Torp dblp: Jesper Torp Kristensen]</ref>
* [[Jesper Torp Kristensen]] ('''2005'''). ''[https://issuu.com/jespertk/docs/master_thesis Generation and compression of endgame tables in chess with fast random access using OBDDs]''. Master thesis, supervisor [[Mathematician#Miltersen|Peter Bro Miltersen]], [https://en.wikipedia.org/wiki/Aarhus_University Aarhus University]
* [[Jesper Torp Kristensen]], [[Mathematician#Miltersen|Peter Bro Miltersen]] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/11809678_51 Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard]''. [https://dblp.uni-trier.de/db/conf/cocoon/cocoon2006.html COCOON 2006]
=External Links=
* [https://issuu.com/jespertk Jesper Torp Kristensen - Issuu]
* [https://github.com/doktoren doktoren (Jesper Torp Kristensen) · GitHub]
: [https://github.com/doktoren/chess-cpp 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=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Kristensen]]
[[Category:Researcher|Kristensen]]
[[FILE:JesperKristensen.jpg|border|right|thumb|link=https://github.com/doktoren| Jesper Kristensen <ref>[https://github.com/doktoren doktoren (Jesper Torp Kristensen) · GitHub]</ref> ]]
'''Jesper Torp Kristensen''',<br/>
a Danish computer scientist affiliated with [https://en.wikipedia.org/wiki/Issuu Issuu] <ref>[https://issuu.com/jespertk Jesper Torp Kristensen - Issuu]</ref>.
He holds a master degree from the Department of Computer Science, [https://en.wikipedia.org/wiki/Aarhus_University Aarhus University] under supervision of [[Mathematician#Miltersen|Peter Bro Miltersen]] on the topic of [[Retrograde Analysis|generation]] and compression of [[Endgame Tablebases|endgame tablebases]] in chess <ref>[[Jesper Torp Kristensen]] ('''2005'''). ''[https://issuu.com/jespertk/docs/master_thesis Generation and compression of endgame tables in chess with fast random access using OBDDs]''. Master thesis, supervisor [[Mathematician#Miltersen|Peter Bro Miltersen]], [https://en.wikipedia.org/wiki/Aarhus_University Aarhus University]</ref>. Applying [https://en.wikipedia.org/wiki/Binary_decision_diagram ordered binary decision diagrams] (OBDDs), the objective was to maximize the number of endgame combinations that can be stored in [[Memory#RAM|RAM]], while still being able to access the tables fast enough to be used during full [[Depth|depth]] [[Search|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 <ref>[http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=6971&start=6 Re: New 6-piece tablebase generator] by [[Ronald de Man|syzygy]], [[Computer Chess Forums|CCRL Discussion Board]], April 06, 2013</ref>
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|Jesper Torp Kristensen's]] master thesis.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/k/Kristensen:Jesper_Torp dblp: Jesper Torp Kristensen]</ref>
* [[Jesper Torp Kristensen]] ('''2005'''). ''[https://issuu.com/jespertk/docs/master_thesis Generation and compression of endgame tables in chess with fast random access using OBDDs]''. Master thesis, supervisor [[Mathematician#Miltersen|Peter Bro Miltersen]], [https://en.wikipedia.org/wiki/Aarhus_University Aarhus University]
* [[Jesper Torp Kristensen]], [[Mathematician#Miltersen|Peter Bro Miltersen]] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/11809678_51 Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard]''. [https://dblp.uni-trier.de/db/conf/cocoon/cocoon2006.html COCOON 2006]
=External Links=
* [https://issuu.com/jespertk Jesper Torp Kristensen - Issuu]
* [https://github.com/doktoren doktoren (Jesper Torp Kristensen) · GitHub]
: [https://github.com/doktoren/chess-cpp 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=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Kristensen]]
[[Category:Researcher|Kristensen]]
