Difference between revisions of "Ernst A. Heinz"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Ernst A. Heinz''' border|right|thumb|| Ernst A. Heinz <ref>[[Chrilly Donninger ('''2000'''). ''Die Wissenschaft...") |
GerdIsenberg (talk | contribs) |
||
| Line 37: | Line 37: | ||
* [[Ernst A. Heinz]] ('''1999'''). ''Adaptive Null-Move Pruning.'' [[ICGA Journal#22_3|ICCA Journal, Vol. 22, No. 3]], [http://people.csail.mit.edu/heinz/ps/adpt_null.ps.gz ps] | * [[Ernst A. Heinz]] ('''1999'''). ''Adaptive Null-Move Pruning.'' [[ICGA Journal#22_3|ICCA Journal, Vol. 22, No. 3]], [http://people.csail.mit.edu/heinz/ps/adpt_null.ps.gz ps] | ||
* [[Ernst A. Heinz]] ('''1999'''). ''Scalable Search in Computer Chess.'' Ph.D. thesis, [http://www.uni-karlsruhe.de/ University of Karlsruhe], advisor [[Mathematician#WFTichy|Walter F. Tichy]] <ref>[http://www.ipd.uka.de/Tichy/people.php?id=45 IPD Tichy - Prof. Dr. Ernst Heinz]</ref> and [[Tony Marsland]] | * [[Ernst A. Heinz]] ('''1999'''). ''Scalable Search in Computer Chess.'' Ph.D. thesis, [http://www.uni-karlsruhe.de/ University of Karlsruhe], advisor [[Mathematician#WFTichy|Walter F. Tichy]] <ref>[http://www.ipd.uka.de/Tichy/people.php?id=45 IPD Tichy - Prof. Dr. Ernst Heinz]</ref> and [[Tony Marsland]] | ||
| − | * [[Ernst A. Heinz]] ('''1999'''). ''[http://people.csail.mit.edu/heinz/node1.html#scale-cchess Scalable Search in Computer Chess]''. [https://en.wikipedia.org/wiki/Morgan_Kaufmann Morgan Kaufmann], [ | + | * [[Ernst A. Heinz]] ('''1999'''). ''[http://people.csail.mit.edu/heinz/node1.html#scale-cchess Scalable Search in Computer Chess]''. [https://en.wikipedia.org/wiki/Morgan_Kaufmann Morgan Kaufmann], [https://de.wikipedia.org/wiki/Vieweg_Verlag Vieweg-Verlag], [https://link.springer.com/book/10.1007/978-3-322-90178-1 Springer Link] <ref>[[Dap Hartmann]] ('''2000'''). ''[http://ilk.uvt.nl/icga/journal/contents/content23-1.htm#THE%20IMPORTANCE%20OF%20BEING%20SCALABLE The Importance of being Scalable]''. [[ICGA Journal#23_1|ICGA Journal, Vol. 23, No. 1]], Review</ref> <ref>[[Chrilly Donninger]] ('''2000'''). ''Die Wissenschaft kehrt zurück - Computerschach-Forschung und das Buch von Ernst Heinz''. [[Computerschach und Spiele|CSS]] 2/00, [http://www.mustrum.de/chrilly/heinz.pdf pdf] (German)</ref> |
| + | : [[FILE:ScalableSearch.jpg|none|border|200px|text-bottom|link=https://link.springer.com/book/10.1007/978-3-322-90178-1]] | ||
==2000 ...== | ==2000 ...== | ||
* [[Ernst A. Heinz]] ('''2000'''). ''AEL Pruning.'' [[ICGA Journal#23_1|ICGA Journal, Vol. 23, No. 1]], [http://www.top-5000.nl/ps/AEL%20pruning.pdf pdf] | * [[Ernst A. Heinz]] ('''2000'''). ''AEL Pruning.'' [[ICGA Journal#23_1|ICGA Journal, Vol. 23, No. 1]], [http://www.top-5000.nl/ps/AEL%20pruning.pdf pdf] | ||
Revision as of 10:08, 2 July 2018
Home * People * Ernst A. Heinz
Ernst A. Heinz [1]
Ernst A. Heinz,
a German computer scientist affiliated with the UMIT, Hall in Tirol [2], and previously with the International University (IU) Bruchsal [3]. In 1993, Ernst A. Heinz and Peter Gillgasch, two students at the University of Karlsruhe, founded a computer-chess group and started to write a chess program, the rotated bitboard engine DarkThought [4], in 1994 joined by Markus Gille [5]. In 1997 Heinz started to write some recognized papers in the ICCA Journal, which were summarized and extended into his 1999 Ph.D thesis Scalable Search in Computer Chess, a revised version merchandised as book. From 1999 until 2002 Ernst A. Heinz was postdoc at MIT [6].
Contents
Scalable Search Topics
Selected Publications
1992 ...
- Ernst A. Heinz (1992). Automatische Elimination von Synchronisationsbarriere in synchronen FORALLs. M.Sc. thesis, University of Karlsruhe, advisor Michael Philippsen (German)
1995 ...
- Michael Philippsen, Ernst A. Heinz (1995). Automatic Synchronization Elimination in Synchronous FORALLs. Frontiers'95
- Lutz Prechelt, Ernst A. Heinz, Paul Lukowicz, Walter F. Tichy (1995). Experimental Evaluation in Computer Science: A Quantitative Study. Journal of Systems and Software, Vol. 28, No. 1
- Ernst A. Heinz (1997). How DarkThought Plays Chess. ICCA Journal, Vol. 20, No. 3
- Ernst A. Heinz (1998). Extended Futility Pruning. ICCA Journal, Vol. 21, No. 2
- Ernst A. Heinz (1998). Efficient Interior-Node Recognition. ICCA Journal, Vol. 21, No. 3
- Ernst A. Heinz (1998). DarkThought Goes Deep. ICCA Journal, Vol. 21, No. 4
- Ernst A. Heinz (1999). Endgame Databases and Efficient Index Schemes for Chess. ICCA Journal, Vol. 22, No. 1, ps
- Ernst A. Heinz (1999). Knowledgeable Encoding and Querying of Endgame Databases. ICCA Journal, Vol. 22, No. 2, ps
- Ernst A. Heinz (1999). Adaptive Null-Move Pruning. ICCA Journal, Vol. 22, No. 3, ps
- Ernst A. Heinz (1999). Scalable Search in Computer Chess. Ph.D. thesis, University of Karlsruhe, advisor Walter F. Tichy [10] and Tony Marsland
- Ernst A. Heinz (1999). Scalable Search in Computer Chess. Morgan Kaufmann, Vieweg-Verlag, Springer Link [11] [12]
2000 ...
- Ernst A. Heinz (2000). AEL Pruning. ICGA Journal, Vol. 23, No. 1, pdf
- Eugene Nalimov, Guy Haworth, Ernst A. Heinz (2000). Space-Efficient Indexing of Chess Endgame Tables. ICGA Journal, Vol. 23, No. 3, postscript
- Ernst A. Heinz (2000). A New Self-Play Experiment in Computer Chess. Massachusetts Institute of Technology, Laboratory of Computer Science, Technical Memo No. 608, zipped ps, pdf
- Ernst A. Heinz (2000). New Self-Play Results in Computer Chess. CG 2000
- Ernst A. Heinz (2001). Self-play Experiments in Computer Chess Revisited. Advances in Computer Games 9
- Ernst A. Heinz (2001). Modeling the “Go Deep” Behaviour of CRAFTY and DARK THOUGHT. Advances in Computer Games 9
- Eugene Nalimov, Guy Haworth, Ernst A. Heinz (2001). Space-efficient Indexing of Endgame Tables for Chess. Advances in Computer Games 9
- Ernst A. Heinz (2001). Selected Goodies of DarkThought. Invited Lecture, 6th Computer Olympiad Workshop, ppt
- Ernst A. Heinz (2001). Self-Play, Deep Search and Diminishing Returns. ICGA Journal, Vol. 24, No. 2
- Ernst A. Heinz (2003). Follow-Up on Self-Play, Deep Search, and Diminishing Returns. ICGA Journal, Vol. 26, No. 2
- Ernst A. Heinz (2003). Static Recognition of Potential Wins in KNNKB and KNNKN. Advances in Computer Games 10
- Jaap van den Herik, Hiroyuki Iida, Ernst A. Heinz (Eds.) (2004). Advances in Computer Games, Many Games, Many Challenges. 10th International Conference, ACG 2003, Graz, Austria, November 24-27, 2003, Revised Papers. Series: IFIP Advances in Information and Communication Technology, Vol. 135
2005 ...
- Ernst A. Heinz, Kai S. Kunze, Matthias Gruber, David Bannach, Paul Lukowicz (2006). Using Wearable Sensors for Real-Time Recognition Tasks in Games of Martial Arts - An Initial Experiment. CIG 2006
- David Bannach, Oliver Amft, Kai S. Kunze, Ernst A. Heinz, Gerhard Tröster, Paul Lukowicz (2007). Waving Real Hand Gestures Recorded by Wearable Motion Sensors to a Virtual Car and Driver in a Mixed-Reality Parking Game. CIG 2007
External Links
References
- ↑ Chrilly Donninger (2000). Die Wissenschaft kehrt zurück - Computerschach-Forschung und das Buch von Ernst Heinz. CSS 2/00, pdf (German)
- ↑ David Bannach, Oliver Amft, Kai S. Kunze, Ernst A. Heinz, Gerhard Tröster, Paul Lukowicz (2007). Waving Real Hand Gestures Recorded by Wearable Motion Sensors to a Virtual Car and Driver in a Mixed-Reality Parking Game. CIG 2007
- ↑ Unternehmen Hochschule: Privatuni in Bruchsal ist pleite, Spiegel Online, July 22, 2009 (German)
- ↑ Rotated Bitboards from Ernst A. Heinz (1997). How DarkThought Plays Chess. ICCA Journal, Vol. 20, No. 3
- ↑ Ernst A. Heinz - Professional Experience
- ↑ Ernst A. Heinz's old personal pages at MIT
- ↑ ICGA Reference Database(pdf)
- ↑ Scientific Articles in Books and Journals
- ↑ dblp: Ernst A. Heinz
- ↑ IPD Tichy - Prof. Dr. Ernst Heinz
- ↑ Dap Hartmann (2000). The Importance of being Scalable. ICGA Journal, Vol. 23, No. 1, Review
- ↑ Chrilly Donninger (2000). Die Wissenschaft kehrt zurück - Computerschach-Forschung und das Buch von Ernst Heinz. CSS 2/00, pdf (German)
