Difference between revisions of "Jesper Torp Kristensen"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Jesper Torp Kristensen''' FILE:JesperKristensen.jpg|border|right|thumb|link=https://github.com/doktoren| Jesper Kristensen <ref>[https:...") |
GerdIsenberg (talk | contribs) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
'''[[Main Page|Home]] * [[People]] * Jesper Torp Kristensen''' | '''[[Main Page|Home]] * [[People]] * Jesper Torp Kristensen''' | ||
| − | [[FILE:JesperKristensen.jpg|border|right|thumb|link=https://github.com/ | + | [[FILE:JesperKristensen.jpg|border|right|thumb|link=https://github.com/jespertk|240px| Jesper Kristensen <ref>[https://github.com/jespertk jespertk (Jesper Torp Kristensen) · GitHub]</ref> ]] |
'''Jesper Torp Kristensen''',<br/> | '''Jesper Torp Kristensen''',<br/> | ||
| − | a Danish computer scientist affiliated with [https://en.wikipedia.org/wiki/ | + | a Danish computer scientist affiliated with [https://en.wikipedia.org/wiki/Bang_%26_Olufsen Bang & Olufsen]. |
| − | 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]]. | + | 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]]. Jesper Kristensen has further written [[Connect Four]] programs in various programming languages <ref>[https://github.com/doktoren doktoren (Jesper Torp Kristensen) · GitHub]</ref>. |
=Quotes= | =Quotes= | ||
| Line 12: | Line 12: | ||
=Selected Publications= | =Selected Publications= | ||
| − | <ref>[https://dblp.uni-trier.de/pers/hd/k/Kristensen:Jesper_Torp dblp: Jesper Torp Kristensen]</ref> | + | <ref>[https://dblp.uni-trier.de/pers/hd/k/Kristensen:Jesper_Torp dblp: Jesper Torp Kristensen]</ref> <ref>[https://issuu.com/jespertk Jesper Torp Kristensen] [https://en.wikipedia.org/wiki/Issuu Issuu]</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]] ('''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:// | + | * [[Jesper Torp Kristensen]], [[Mathematician#Miltersen|Peter Bro Miltersen]] ('''2006'''). ''[https://issuu.com/jespertk/docs/article Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard]''. [https://dblp.uni-trier.de/db/conf/cocoon/cocoon2006.html COCOON 2006] |
=External Links= | =External Links= | ||
| − | * [https:// | + | * [https://github.com/jespertk jespertk (Jesper Torp Kristensen) · GitHub] |
* [https://github.com/doktoren doktoren (Jesper Torp Kristensen) · GitHub] | * [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] | : [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] | ||
| Line 26: | Line 26: | ||
[[Category:Chess Programmer|Kristensen]] | [[Category:Chess Programmer|Kristensen]] | ||
[[Category:Researcher|Kristensen]] | [[Category:Researcher|Kristensen]] | ||
| + | [[Category:Quotes|Kristensen]] | ||
Latest revision as of 16:00, 7 December 2019
Home * People * Jesper Torp Kristensen
Jesper Kristensen [1]
Jesper Torp Kristensen,
a Danish computer scientist affiliated with Bang & Olufsen.
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 [2]. 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. Jesper Kristensen has further written Connect Four programs in various programming languages [3].
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 [4]
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
References
- ↑ jespertk (Jesper Torp Kristensen) · GitHub
- ↑ 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
- ↑ doktoren (Jesper Torp Kristensen) · GitHub
- ↑ Re: New 6-piece tablebase generator by syzygy, CCRL Discussion Board, April 06, 2013
- ↑ dblp: Jesper Torp Kristensen
- ↑ Jesper Torp Kristensen Issuu
