25,161
edits
Changes
no edit summary
* [[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]] ('''1983'''). ''Searching to Variable Depth in Computer Chess.'' Proceedings of . [[http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai83.html Conferences#IJCAI1983|IJCAI 831983], pp. 760-762. Karlsruhe. [http://ijcai.org/Past%20Proceedings/IJCAI-83-VOL-2/PDF/039.pdf pdf]* [[Hermann Kaindl]] ('''1985'''). ''[httphttps://portallink.acmspringer.orgcom/chapter/citation10.cfm?id=645759.666297 1007%2F978-3-642-46552-9_22 What Happened with AI's Drosophila]''? [httphttps://www.informatiklink.uni-trierspringer.decom/~leybook/db10.1007/conf/ogai/ogai1985.html 978-3-642-46552-9 ÖGAI 1985]: 194-203
* [[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''. [[AAAI#AIMAG|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'''). ''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]] ('''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]], [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 [[Conferences#IJCAI1989|IJCAI, pp. 322–327, Detroit, MI.1989]]
==1990 ...==
* [[Hermann Kaindl]] ('''1990'''). ''Tree Searching Algorithms''. [[Computers, Chess, and Cognition]], pp. 133-158
* [[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]
* [[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#SMC|IEEE Transactions on Systems, Man, and Cybernetics]], Vol. 22, No. 5, pp. 992-1007.
* [[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]]* [[Anton Scheucher]], [http[Hermann Kaindl]] ('''1998'''). ''[https://dliwww.iiitsciencedirect.accom/science/article/pii/S0004370297000738 Benefits of Using Multivalued Functions for Minimaxing]''.in[https:/ijcai/IJCAI-95-VOL%201en.wikipedia.org/pdfwiki/031Artificial_Intelligence_(journal) Artificial Intelligence], Vol.pdf pdf]99, No. 2
==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]
* [[Hermann Kaindl]], [[Stefan Kramer]] ('''2006'''). ''Are Automated Traceability Checks Needed?'' ISOneWorld 2006==2010 ...==* [[Hermann Kaindl]], [[Helmut Horacek]], [[httpAnton Scheucher]] ('''2017'''). ''[https://wwwkramer.inieeexplore.tumieee.deorg/researchdocument/pubs/kai06kra Are Automated Traceability Checks Needed7358032 Product Propagation: A Back-up Rule Better than Minimaxing?]'' ISOneWorld 2006[[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 9, No. 2, [[:File:KaindlProductPropagation.pdf|pdf]]
=External Links=
* [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]
* [http://www.cs.ucl.ac.uk/research/renoir/members/siemens.html Siemens AG Österreich]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Kaindl]]
[[Category:Chess Programmer|Kaindl]]
