Difference between revisions of "Hermann Kaindl"

From Chessprogramming wiki
Jump to: navigation, search
 
(3 intermediate revisions by the same user not shown)
Line 18: Line 18:
  
 
=Selected Publications=  
 
=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/k/Kaindl:Hermann.html dblp: Hermann Kaindl]</ref>
+
<ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref>  <ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/k/Kaindl:Hermann.html dblp: Hermann Kaindl]</ref>
 
==1978==
 
==1978==
 
* [[Hermann Kaindl]], [[Werner Schimanovich]] ('''1978'''). ''Catrin - Mathematical 2-person-game''. University of Vienna
 
* [[Hermann Kaindl]], [[Werner Schimanovich]] ('''1978'''). ''Catrin - Mathematical 2-person-game''. University of Vienna
Line 26: Line 26:
 
* [[Hermann Kaindl]] ('''1982'''). ''Positional Long-Range Planning in Computer Chess.'' [[Advances in Computer Chess 3]], also published as [[Hermann Kaindl]] ('''1983'''). ''Positional Long-Range Planning in Computer Chess.'' [[Vienna University of Technology]], Austria.
 
* [[Hermann Kaindl]] ('''1982'''). ''Positional Long-Range Planning in Computer Chess.'' [[Advances in Computer Chess 3]], also published as [[Hermann Kaindl]] ('''1983'''). ''Positional Long-Range Planning in Computer Chess.'' [[Vienna University of Technology]], Austria.
 
* [[Hermann Kaindl]] ('''1982'''). ''Quiescence Search in Computer Chess.'' SIGART Newsletter, 80, pp. 124-131. Reprinted (1983) in Computer-Game-Playing: Theory and Practice, pp. 39-52. Ellis Horwood Ltd., Chichester. » [[Quiescence Search]]
 
* [[Hermann Kaindl]] ('''1982'''). ''Quiescence Search in Computer Chess.'' SIGART Newsletter, 80, pp. 124-131. Reprinted (1983) in Computer-Game-Playing: Theory and Practice, pp. 39-52. Ellis Horwood Ltd., Chichester. » [[Quiescence Search]]
* [[Hermann Kaindl]] ('''1983'''). ''Searching to Variable Depth in Computer Chess.'' Proceedings of [http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai83.html IJCAI 83], pp. 760-762. Karlsruhe. [http://ijcai.org/Past%20Proceedings/IJCAI-83-VOL-2/PDF/039.pdf pdf]
+
* [[Hermann Kaindl]] ('''1983'''). ''Searching to Variable Depth in Computer Chess''. [[Conferences#IJCAI1983|IJCAI 1983]]
* [[Hermann Kaindl]] ('''1985'''). ''[http://portal.acm.org/citation.cfm?id=645759.666297 What Happened with AI's Drosophila]''? [http://www.informatik.uni-trier.de/~ley/db/conf/ogai/ogai1985.html ÖGAI 1985]: 194-203
+
* [[Hermann Kaindl]] ('''1985'''). ''[https://link.springer.com/chapter/10.1007%2F978-3-642-46552-9_22 What Happened with AI's Drosophila]''? [https://link.springer.com/book/10.1007/978-3-642-46552-9 ÖGAI 1985]
 
* [[Hermann Kaindl]], [[Helmut Horacek]], [[Marcus Wagner]] ('''1986'''). ''Selective Search versus Brute Force.'' [[ICGA Journal#9_3|ICCA Journal, Vol. 9, No. 3]]
 
* [[Hermann Kaindl]], [[Helmut Horacek]], [[Marcus Wagner]] ('''1986'''). ''Selective Search versus Brute Force.'' [[ICGA Journal#9_3|ICCA Journal, Vol. 9, No. 3]]
* [[Hermann Kaindl]] ('''1988'''). ''Minimaxing Theory and Practice''. AI Magazine, Vol. 9, No. 3, pp. 69-76. [http://www.aaai.org/ojs/index.php/aimagazine/article/viewFile/944/862 pdf]
+
* [[Hermann Kaindl]] ('''1988'''). ''Minimaxing Theory and Practice''. [[AAAI#AIMAG|AI Magazine]], Vol. 9, No. 3, [http://www.aaai.org/ojs/index.php/aimagazine/article/viewFile/944/862 pdf]
 
* [[Hermann Kaindl]] ('''1988'''). ''Useful Statistics from Tournament Programs''. [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]]
 
* [[Hermann Kaindl]] ('''1988'''). ''Useful Statistics from Tournament Programs''. [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]]
 
* [[Hermann Kaindl]], [[Marcus Wagner]], [[Helmut Horacek]] ('''1988'''). ''Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees: The Details.'' Tech. Report #50, Department of Statistics and Computer Science, [[Vienna University of Technology]], Austria.
 
* [[Hermann Kaindl]], [[Marcus Wagner]], [[Helmut Horacek]] ('''1988'''). ''Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees: The Details.'' Tech. Report #50, Department of Statistics and Computer Science, [[Vienna University of Technology]], Austria.
 
* [[Hermann Kaindl]], [[Marcus Wagner]], [[Helmut Horacek]] ('''1989'''). ''Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees''. [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]]
 
* [[Hermann Kaindl]], [[Marcus Wagner]], [[Helmut Horacek]] ('''1989'''). ''Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees''. [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]]
 
* [[Hermann Kaindl]] ('''1989'''). ''Towards a Theory of Knowledge''. [[Advances in Computer Chess 5]]
 
* [[Hermann Kaindl]] ('''1989'''). ''Towards a Theory of Knowledge''. [[Advances in Computer Chess 5]]
* [[Hermann Kaindl]], [http://www.arnetminer.org/viewperson.do?naid=276308&name=Anton%20Scheucher Anton Scheucher] ('''1989'''). ''The Reason for the Benefits of Minmax Search''. Proc. of the 11 th IJCAI, pp. 322–327, Detroit, MI.
+
* [[Hermann Kaindl]], [[Anton Scheucher]] ('''1989'''). ''The Reason for the Benefits of Minmax Search''. [[Conferences#IJCAI1989|IJCAI 1989]]
 
==1990 ...==  
 
==1990 ...==  
 
* [[Hermann Kaindl]] ('''1990'''). ''Tree Searching Algorithms''. [[Computers, Chess, and Cognition]], pp. 133-158
 
* [[Hermann Kaindl]] ('''1990'''). ''Tree Searching Algorithms''. [[Computers, Chess, and Cognition]], pp. 133-158
Line 40: Line 40:
 
* [[Reza Shams]], [[Hermann Kaindl]], [[Helmut Horacek]] ('''1991'''). ''Using Aspiration Windows for Minimax Algorithms''. [[Conferences#IJCAI1991|IJCAI 1991]], [http://ijcai.org/Proceedings/91-1/Papers/031.pdf pdf]
 
* [[Reza Shams]], [[Hermann Kaindl]], [[Helmut Horacek]] ('''1991'''). ''Using Aspiration Windows for Minimax Algorithms''. [[Conferences#IJCAI1991|IJCAI 1991]], [http://ijcai.org/Proceedings/91-1/Papers/031.pdf pdf]
 
* [[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1991'''). ''[https://link.springer.com/chapter/10.1007/978-3-662-02711-0_6 Feature Construction during Tree Learning]''. [https://dblp.uni-trier.de/db/conf/ki/gwai91.html GWAI 1991]
 
* [[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1991'''). ''[https://link.springer.com/chapter/10.1007/978-3-662-02711-0_6 Feature Construction during Tree Learning]''. [https://dblp.uni-trier.de/db/conf/ki/gwai91.html GWAI 1991]
* [[Hermann Kaindl]], [http://www.arnetminer.org/viewperson.do?naid=276308&name=Anton%20Scheucher Anton Scheucher] ('''1992'''). ''Reasons for the Effect of Bounded Look-Ahead Search''. IEEE Transactions on Systems, Man, and Cybernetics, Vol. 22, No. 5, pp. 992-1007.
+
* [[Hermann Kaindl]], [[Anton Scheucher]] ('''1992'''). ''Reasons for the Effect of Bounded Look-Ahead Search''. [[IEEE#SMC|IEEE Transactions on Systems, Man, and Cybernetics]], Vol. 22, No. 5
 
* [[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1995'''). ''Feature Construction during Tree Learning''. [https://dblp.uni-trier.de/db/conf/gosler/gosler1995.html GOSLER Final Report] 1995
 
* [[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1995'''). ''Feature Construction during Tree Learning''. [https://dblp.uni-trier.de/db/conf/gosler/gosler1995.html GOSLER Final Report] 1995
* [[Hermann Kaindl]], Gerhard Kainz, Angelika Leeb, Harald Smetana ('''1995'''). ''How to use limited memory in heuristic search''. [[Conferences#IJCAI1995|IJCAI 1995]], [http://dli.iiit.ac.in/ijcai/IJCAI-95-VOL%201/pdf/031.pdf pdf]
+
* [[Hermann Kaindl]], Gerhard Kainz, Angelika Leeb, Harald Smetana ('''1995'''). ''How to use limited memory in heuristic search''. [[Conferences#IJCAI1995|IJCAI 1995]]
 +
* [[Anton Scheucher]], [[Hermann Kaindl]] ('''1998'''). ''[https://www.sciencedirect.com/science/article/pii/S0004370297000738 Benefits of Using Multivalued Functions for Minimaxing]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 99, No. 2
 
==2000 ...==
 
==2000 ...==
 
* [[Johannes Fürnkranz]], [[Bernhard Pfahringer]], [[Hermann Kaindl]], [[Stefan Kramer]] ('''2000'''). ''[https://scholar.google.com/citations?view_op=view_citation&hl=en&user=0QXx46sAAAAJ&cstart=20&pagesize=80&citation_for_view=0QXx46sAAAAJ:k_IJM867U9cC Learning to Use Operational Advice]''. ECAI-00, [http://www.ke.informatik.tu-darmstadt.de/%7Ejuffi/publications/ecai-00.pdf pdf]
 
* [[Johannes Fürnkranz]], [[Bernhard Pfahringer]], [[Hermann Kaindl]], [[Stefan Kramer]] ('''2000'''). ''[https://scholar.google.com/citations?view_op=view_citation&hl=en&user=0QXx46sAAAAJ&cstart=20&pagesize=80&citation_for_view=0QXx46sAAAAJ:k_IJM867U9cC Learning to Use Operational Advice]''. ECAI-00, [http://www.ke.informatik.tu-darmstadt.de/%7Ejuffi/publications/ecai-00.pdf pdf]
* [[Hermann Kaindl]], [[Stefan Kramer]] ('''2006'''). ''[http://wwwkramer.in.tum.de/research/pubs/kai06kra Are Automated Traceability Checks Needed?]'' ISOneWorld 2006
+
* [[Hermann Kaindl]], [[Stefan Kramer]] ('''2006'''). ''Are Automated Traceability Checks Needed?'' ISOneWorld 2006
 +
==2010 ...==
 +
* [[Hermann Kaindl]], [[Helmut Horacek]], [[Anton Scheucher]] ('''2017'''). ''[https://ieeexplore.ieee.org/document/7358032 Product Propagation: A Back-up Rule Better than Minimaxing?]'' [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 9, No. 2, [[:File:KaindlProductPropagation.pdf|pdf]]
 +
* [[Hermann Kaindl]] ('''2018'''). ''[https://cacm.acm.org/magazines/2018/12/232884-reclaim-internet-greatness/fulltext Comment - Lookahead Search for Computer Chess]''. [[ACM#Communications|Communications of the ACM]], Vol. 61, No. 12 » [[AlphaZero]] <ref>Comment concerning [[AlphaZero]] on [[Mathematician#VGCerf|Vinton G. Cerf]] ('''2018'''). ''[https://cacm.acm.org/magazines/2018/7/229041-on-neural-networks/fulltext On Neural Networks]''. [[ACM#Communications|Communications of the ACM]], Vol. 61, No. 7</ref>
  
 
=External Links=
 
=External Links=
 
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=377 Hermann Kaindl's ICGA Tournaments]
 
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=377 Hermann Kaindl's ICGA Tournaments]
 
* [https://www.ict.tuwien.ac.at/en/mitarbeiter/kaindl Univ.Prof. Dipl.-Ing. Dr. Hermann Kaindl]
 
* [https://www.ict.tuwien.ac.at/en/mitarbeiter/kaindl Univ.Prof. Dipl.-Ing. Dr. Hermann Kaindl]
* [http://www.ads.tuwien.ac.at/people/Kaindl.html Univ.Prof. Dipl.-Ing. Dr.techn. Hermann Kaindl] (2005)
 
 
* [http://www.cs.ucl.ac.uk/research/renoir/members/siemens.html Siemens AG Österreich]
 
* [http://www.cs.ucl.ac.uk/research/renoir/members/siemens.html Siemens AG Österreich]
  
 
=References=
 
=References=
 
<references />
 
<references />
 
 
'''[[People|Up one level]]'''
 
'''[[People|Up one level]]'''
 +
[[Category:Researcher|Kaindl]]
 +
[[Category:Chess Programmer|Kaindl]]

Latest revision as of 10:59, 3 April 2021

Home * People * Hermann Kaindl

Hermann Kaindl [1]

Hermann Kaindl,
an Austrian computer scientist, games researcher and since 2003 full professor at the Vienna University of Technology, where he already defended his Ph.D. under supervision of Wilhelm Barth [2] [3]. Kaindl was senior consultant with the division of program and systems engineering at Siemens AG Austria. Concurrently to his work in the industry, Kaindl has given lectures in computer science at the Technical University of Vienna since 1984, where he received the venia docendi in applied computer science (Praktische Informatik) in 1989 [4].

Merlin

As student, Hermann Kaindl was primary author of the chess program Merlin, along with Helmut Horacek, Marcus Wagner and Roland Schreier, competing at various ACM North American Computer Chess Championships and two World Computer Chess Championships in the 80s [5].

Photos

ACC5.jpg

Advances in Computer Chess 5 Smalltalk:
Hans Berliner, Hermann Kaindl, Helmut Horacek, Adriaan de Groot and Reiner Seidel [6]

See also

Selected Publications

[7] [8]

1978

1980 ...

1990 ...

2000 ...

2010 ...

External Links

References

  1. Univ.Prof. Dipl.-Ing. Dr. Hermann Kaindl
  2. Hermann Kaindl (1981). Realisierung von langfristigem Planen und Massnahmen gegen den Horizont-Effekt im Computer-Schach. Doctoral Dissertation. Vienna University of Technology
  3. Werner DePauli-Schimanovich (2006). Europolis 6. Informatik für Spiele und Verkehr. Extension der Mengenlehre, Herausgeber: Franz Pichler, Universitätsverlag Rudolf Trauner, (SG7) Merlin (ein ComputerChess-Programm) s. 171 (German), Google Books
  4. Siemens AG Österreich
  5. Merlin's ICGA Tournaments
  6. Photo by László Lindner, ICCA Journal, Vol. 10, No. 3, pp. 117
  7. ICGA Reference Database
  8. dblp: Hermann Kaindl
  9. Comment concerning AlphaZero on Vinton G. Cerf (2018). On Neural Networks. Communications of the ACM, Vol. 61, No. 7

Up one level