25,161
edits
Changes
Created page with "'''Home * People * Kai Himstedt''' FILE:KaiHimstedt.jpg|border|right|thumb|300px|link=http://www.schachclub-forchheim.de/aktuelles/archives/605-Mit-Jonny-..."
'''[[Main Page|Home]] * [[People]] * Kai Himstedt'''
[[FILE:KaiHimstedt.jpg|border|right|thumb|300px|link=http://www.schachclub-forchheim.de/aktuelles/archives/605-Mit-Jonny-muss-gerechnet-werden.html| Kai Himstedt <ref>[http://www.schachclub-forchheim.de/aktuelles/archives/605-Mit-Jonny-muss-gerechnet-werden.html Mit "Jonny" muss gerechnet werden] June 19, 2007, [http://www.schachclub-forchheim.de/ Schachclub Forchheim]</ref> ]]
'''Kai Himstedt''',<br/>
a German computer scientist and Ph.D. from the [[University of Hamburg]] on [[Parallel Search|parallel game-tree search]] and [https://en.wikipedia.org/wiki/Grid_computing Grid computing] <ref>[http://www.informatik.uni-hamburg.de/TIS/index.php/de/projekte/phd-projects/79/ PhD Project of Kai Himstedt (Dipl.-Inform.)]</ref> <ref>[[Kai Himstedt]] ('''2012'''). ''[http://www.shaker.de/de/content/catalogue/index.asp?ID=8&ISBN=978-3-8440-0803-6 Optimistische verteilte Spielbaumsuche am Beispiel des Computerschachs]''. Dissertation (German)</ref>. Along with [[Ulf Lorenz]], he is principle author of [[GridChess]] and [[Cluster Toga]], cluster chess programs based on the [[Open Source Engines|open source chess programs]] [[Fruit]] by [[Fabien Letouzey]], and the Fruit derivate [[Toga]]. GridChess is the doctorate of Kai Himstedt and a cooperation between the [[Paderborn University]] and the University of Hamburg. GridChess played the [[WCCC 2007]], Cluster Toga the [[WCCC 2008]] <ref>[https://www.game-ai-forum.org/icga-tournaments/person.php?id=512 Kai Himstedt's ICGA Tournaments]</ref>. His further cluster chess projects [[GridProtector]] and [[GridGinkgo]], playing the [[PT 49]] in October 2015, and the [[WCCC 2016]], incorporate [[Raimund Heid|Raimund Heid's]] [[Protector]], and [[Frank Schneider|Frank Schneider's]] [[Ginkgo]] respectively.
<span id="Jugendforscht"></span>
=Jugend forscht=
[[FILE:1980-Stahn-Himstedt.jpg|border|right|thumb|300px|link=https://www.jugend-forscht.de/projektdatenbank/die-entwicklung-eines-schachprogramms-als-beispiel-fuer-eine-spezielle-form-der-kuenstlichen-intelligenz.html| [[Kai Himstedt]], [[Wolfgang Stahn]], Jugend forscht <ref>[https://www.jugend-forscht.de/projektdatenbank/die-entwicklung-eines-schachprogramms-als-beispiel-fuer-eine-spezielle-form-der-kuenstlichen-intelligenz.html Jugend forscht 1980 | Mathematik/Informatik | Die Entwicklung eines Schachprogramms als Beispiel für eine spezielle Form der künstlichen Intelligenz]</ref>]]
As a teenager during the late 70s, Kai Himstedt already developed a chess program along with [[Wolfgang Stahn]] and participated at [https://en.wikipedia.org/wiki/Jugend_forscht Jugend forscht], a German youth science competition, initiated in 1965 by [https://en.wikipedia.org/wiki/Henri_Nannen Henri Nannen], then editor-in-chief of the [https://en.wikipedia.org/wiki/Stern_%28magazine%29 Stern magazine]. In 1980, they won the second prize in the mathematics and computer science section <ref>[http://www.jugend-forscht.de/projektdatenbank/die-entwicklung-eines-schachprogramms-als-beispiel-fuer-eine-spezielle-form-der-kuenstlichen-intelligenz/2.html Jugend forscht 1980 | Mathematik/Informatik | Die Entwicklung eines Schachprogramms als Beispiel für eine spezielle Form der künstlichen Intelligenz] (German), translated with the help of [https://en.wikipedia.org/wiki/Google_Translate Google Translate]</ref>:
Inspired by the chess computer boom and not impressed by the programs offered at the time, the two young friends developed their own computer chess program. As a comparison, the modern American chess program [[Chess (Program)|Chess 4.8]] was available, in which the two young mathematicians discovered certain weaknesses.
By using the [[Fortran|FORTRAN]] programming language and the [[TR 440]] computer, the two young mathematicians set about developing their new program. The considerations for the development took about four weeks. Then in April 1979, first games could been played, but were unsatisfactory in the eyes of young researchers. Further improvements of the program made it possible that one of the best micro-computer chess prograns, the [[Chess Challenger|Chess Challenger 7]] could be beaten.
Their program proved to be so good that even the computer chess world champion Chess 4.8 could be beaten when using a suitable computer. A special feature of the new program is that an exchange of pieces with its effects on the overall course of the game was not completely calculated by search, but [[Static Exchange Evaluation|evaluated statically]], yielding in a considerable shortening of the processing time.
=See also=
* [[Andreas Rudin]]
* [[Kalah#Jugendforscht|Paul Erich Frielinghaus - Kalah - Jugend forscht]]
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/h/Himstedt:Kai.html DBLP: Kai Himstedt]</ref>
* [[Kai Himstedt]] ('''1993'''). ''Verfahren zur Vermeidung redundanter Übersetzungen in modularen Softwaresystemen''. Diplomarbeit im Fach Informatik, Universität Hamburg, Hamburg. (German)
* [[Kai Himstedt]] ('''2005'''). ''An Optimistic [[Pondering]] Approach for Asynchronous Distributed Games''. [[ICGA Journal#28_2|ICGA Journal, Vol. 28, No. 2]]
* [[Kai Himstedt]], [[Ulf Lorenz]], [http://www.informatik.uni-hamburg.de/TIS/index.php Dietmar P. F. Möller] ('''2008'''). ''[http://www.springerlink.com/content/2471845u5w6j1211/ A Twofold Distributed Game-Tree Search Approach Using Interconnected Clusters]''. Euro-Par 2008: 587-598
* [[Kai Himstedt]] ('''2012'''). ''[http://www.shaker.de/de/content/catalogue/index.asp?ID=8&ISBN=978-3-8440-0803-6 Optimistische verteilte Spielbaumsuche am Beispiel des Computerschachs]''. Dissertation (German) <ref>[[Dap Hartmann]] ('''2013'''). ''Optimistically Parallelizing Parallel Search Processes''. [[ICGA Journal#36_2|ICGA Journal, Vol. 36, No. 2]], Review</ref>
* [[Kai Himstedt]] ('''2012'''). ''GridChess: Combining Optimistic Pondering with the Young Brothers Wait Concept''. [[ICGA Journal#35_2|ICGA Journal, Vol. 35, No. 2]]
=External Links=
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=512 Kai Himstedt's ICGA Tournaments]
* [https://www.jugend-forscht.de/projektdatenbank/die-entwicklung-eines-schachprogramms-als-beispiel-fuer-eine-spezielle-form-der-kuenstlichen-intelligenz.html Jugend forscht 1980 | Mathematik/Informatik | Die Entwicklung eines Schachprogramms als Beispiel für eine spezielle Form der künstlichen Intelligenz] (German)
* [http://www.informatik.uni-hamburg.de/TIS/index.php/de/projekte/phd-projects/79/ PhD Project of Kai Himstedt (Dipl.-Inform.)]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:KaiHimstedt.jpg|border|right|thumb|300px|link=http://www.schachclub-forchheim.de/aktuelles/archives/605-Mit-Jonny-muss-gerechnet-werden.html| Kai Himstedt <ref>[http://www.schachclub-forchheim.de/aktuelles/archives/605-Mit-Jonny-muss-gerechnet-werden.html Mit "Jonny" muss gerechnet werden] June 19, 2007, [http://www.schachclub-forchheim.de/ Schachclub Forchheim]</ref> ]]
'''Kai Himstedt''',<br/>
a German computer scientist and Ph.D. from the [[University of Hamburg]] on [[Parallel Search|parallel game-tree search]] and [https://en.wikipedia.org/wiki/Grid_computing Grid computing] <ref>[http://www.informatik.uni-hamburg.de/TIS/index.php/de/projekte/phd-projects/79/ PhD Project of Kai Himstedt (Dipl.-Inform.)]</ref> <ref>[[Kai Himstedt]] ('''2012'''). ''[http://www.shaker.de/de/content/catalogue/index.asp?ID=8&ISBN=978-3-8440-0803-6 Optimistische verteilte Spielbaumsuche am Beispiel des Computerschachs]''. Dissertation (German)</ref>. Along with [[Ulf Lorenz]], he is principle author of [[GridChess]] and [[Cluster Toga]], cluster chess programs based on the [[Open Source Engines|open source chess programs]] [[Fruit]] by [[Fabien Letouzey]], and the Fruit derivate [[Toga]]. GridChess is the doctorate of Kai Himstedt and a cooperation between the [[Paderborn University]] and the University of Hamburg. GridChess played the [[WCCC 2007]], Cluster Toga the [[WCCC 2008]] <ref>[https://www.game-ai-forum.org/icga-tournaments/person.php?id=512 Kai Himstedt's ICGA Tournaments]</ref>. His further cluster chess projects [[GridProtector]] and [[GridGinkgo]], playing the [[PT 49]] in October 2015, and the [[WCCC 2016]], incorporate [[Raimund Heid|Raimund Heid's]] [[Protector]], and [[Frank Schneider|Frank Schneider's]] [[Ginkgo]] respectively.
<span id="Jugendforscht"></span>
=Jugend forscht=
[[FILE:1980-Stahn-Himstedt.jpg|border|right|thumb|300px|link=https://www.jugend-forscht.de/projektdatenbank/die-entwicklung-eines-schachprogramms-als-beispiel-fuer-eine-spezielle-form-der-kuenstlichen-intelligenz.html| [[Kai Himstedt]], [[Wolfgang Stahn]], Jugend forscht <ref>[https://www.jugend-forscht.de/projektdatenbank/die-entwicklung-eines-schachprogramms-als-beispiel-fuer-eine-spezielle-form-der-kuenstlichen-intelligenz.html Jugend forscht 1980 | Mathematik/Informatik | Die Entwicklung eines Schachprogramms als Beispiel für eine spezielle Form der künstlichen Intelligenz]</ref>]]
As a teenager during the late 70s, Kai Himstedt already developed a chess program along with [[Wolfgang Stahn]] and participated at [https://en.wikipedia.org/wiki/Jugend_forscht Jugend forscht], a German youth science competition, initiated in 1965 by [https://en.wikipedia.org/wiki/Henri_Nannen Henri Nannen], then editor-in-chief of the [https://en.wikipedia.org/wiki/Stern_%28magazine%29 Stern magazine]. In 1980, they won the second prize in the mathematics and computer science section <ref>[http://www.jugend-forscht.de/projektdatenbank/die-entwicklung-eines-schachprogramms-als-beispiel-fuer-eine-spezielle-form-der-kuenstlichen-intelligenz/2.html Jugend forscht 1980 | Mathematik/Informatik | Die Entwicklung eines Schachprogramms als Beispiel für eine spezielle Form der künstlichen Intelligenz] (German), translated with the help of [https://en.wikipedia.org/wiki/Google_Translate Google Translate]</ref>:
Inspired by the chess computer boom and not impressed by the programs offered at the time, the two young friends developed their own computer chess program. As a comparison, the modern American chess program [[Chess (Program)|Chess 4.8]] was available, in which the two young mathematicians discovered certain weaknesses.
By using the [[Fortran|FORTRAN]] programming language and the [[TR 440]] computer, the two young mathematicians set about developing their new program. The considerations for the development took about four weeks. Then in April 1979, first games could been played, but were unsatisfactory in the eyes of young researchers. Further improvements of the program made it possible that one of the best micro-computer chess prograns, the [[Chess Challenger|Chess Challenger 7]] could be beaten.
Their program proved to be so good that even the computer chess world champion Chess 4.8 could be beaten when using a suitable computer. A special feature of the new program is that an exchange of pieces with its effects on the overall course of the game was not completely calculated by search, but [[Static Exchange Evaluation|evaluated statically]], yielding in a considerable shortening of the processing time.
=See also=
* [[Andreas Rudin]]
* [[Kalah#Jugendforscht|Paul Erich Frielinghaus - Kalah - Jugend forscht]]
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/h/Himstedt:Kai.html DBLP: Kai Himstedt]</ref>
* [[Kai Himstedt]] ('''1993'''). ''Verfahren zur Vermeidung redundanter Übersetzungen in modularen Softwaresystemen''. Diplomarbeit im Fach Informatik, Universität Hamburg, Hamburg. (German)
* [[Kai Himstedt]] ('''2005'''). ''An Optimistic [[Pondering]] Approach for Asynchronous Distributed Games''. [[ICGA Journal#28_2|ICGA Journal, Vol. 28, No. 2]]
* [[Kai Himstedt]], [[Ulf Lorenz]], [http://www.informatik.uni-hamburg.de/TIS/index.php Dietmar P. F. Möller] ('''2008'''). ''[http://www.springerlink.com/content/2471845u5w6j1211/ A Twofold Distributed Game-Tree Search Approach Using Interconnected Clusters]''. Euro-Par 2008: 587-598
* [[Kai Himstedt]] ('''2012'''). ''[http://www.shaker.de/de/content/catalogue/index.asp?ID=8&ISBN=978-3-8440-0803-6 Optimistische verteilte Spielbaumsuche am Beispiel des Computerschachs]''. Dissertation (German) <ref>[[Dap Hartmann]] ('''2013'''). ''Optimistically Parallelizing Parallel Search Processes''. [[ICGA Journal#36_2|ICGA Journal, Vol. 36, No. 2]], Review</ref>
* [[Kai Himstedt]] ('''2012'''). ''GridChess: Combining Optimistic Pondering with the Young Brothers Wait Concept''. [[ICGA Journal#35_2|ICGA Journal, Vol. 35, No. 2]]
=External Links=
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=512 Kai Himstedt's ICGA Tournaments]
* [https://www.jugend-forscht.de/projektdatenbank/die-entwicklung-eines-schachprogramms-als-beispiel-fuer-eine-spezielle-form-der-kuenstlichen-intelligenz.html Jugend forscht 1980 | Mathematik/Informatik | Die Entwicklung eines Schachprogramms als Beispiel für eine spezielle Form der künstlichen Intelligenz] (German)
* [http://www.informatik.uni-hamburg.de/TIS/index.php/de/projekte/phd-projects/79/ PhD Project of Kai Himstedt (Dipl.-Inform.)]
=References=
<references />
'''[[People|Up one level]]'''
