Andreas Junghanns

**[[Home]] * [[People]] * Andreas Junghanns**
|| [[image:junghanns.jpg link="http://www.qtronic.de/en/andreas_junghanns.html"]] ||~   || **Andreas Junghanns**,
a German computer scientist. Junghanns studied at the [[Chemnitz University of Technology|Technical University of Chemnitz]], Germany, in Madrid, Spain, and at the [[University of Alberta]], Canada from 1994 until 1999, where he defended his Ph.D. thesis //Pushing the Limits: New Developments in Single-Agent Search// [[[Andreas Junghanns#PushingtheLimits|Jung 1999]]] in 1999. His research interests include [[Search|search algorithms]] like [[http://en.wikipedia.org/wiki/Intelligent_agent|single-agent]] search applied to the game of [[Sokoban]]. Along with [[Yngvi Björnsson]], Junghanns co-authored the chess program [[The Turk]], which was test-bed of their [[Uncertainty Cut-Offs]].

After some years of corporate IT research, Andreas Junghanns co-founded the //QTronic GmbH// 2006 in Berlin, Germany <ref>[[http://www.qtronic.de/en/andreas_junghanns.html|Andreas Junghanns, Ph.D.]] founder [[https://www.qtronic.de/en/company.html|QTronic GmbH]] 2006</ref>. ||
|| Andreas Junghanns <ref>[[http://www.qtronic.de/de/andreas_junghanns.html|Dr. Andreas Junghanns | QTronic GmbH]]</ref>   ||~   ||^  ||
[[toc]]
=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/pers/hd/j/Junghanns:Andreas|dblp: Andreas Junghanns]]</ref>
==1994 ...== 
* [[Andreas Junghanns]] (**1994**). //Methoden zur Verbesserung von Suchalgorithmen.// Diplomarbeit, [[Chemnitz University of Technology|Technische Universität Chemnitz-Zwickau]].
* [[Andreas Junghanns]] (**1994**). //Fuzzy Numbers as a Tool in Chess Programs.// [[ICGA Journal#17_3|ICCA Journal, Vol. 17, No. 3]]
* [[Andreas Junghanns]], [[Christian Posthoff]], [[Michael Schlosser]] (**1995**). //Search with Fuzzy Numbers.// In: Proc. of the FUZZ-IEEE/IFES'95, Yokohama/Japan, 20.-24. März 1995, Vol. II
* [[Yngvi Björnsson]], [[Mark Brockington]], [[Andreas Junghanns]], [[Aske Plaat]] (**1996**). //Report on the Advances in Computer Chess 8 Conference//. [[ICGA Journal#19_3|ICCA Journal, Vol. 19, No. 3]] » [[Advances in Computer Chess 8]]
* [[Yngvi Björnsson]], [[Tony Marsland]], [[Jonathan Schaeffer]], [[Andreas Junghanns]] (**1997**). //Searching with Uncertainty Cut-offs.// [[ICGA Journal#20_1|ICCA Journal, Vol. 20, No. 1]], [[http://www.ru.is/faculty/yngvi/pdf/BjornssonMSJ00.pdf|pdf preprint]]
* [[Yngvi Björnsson]], [[Tony Marsland]], [[Jonathan Schaeffer]], [[Andreas Junghanns]] (**1997**). //Searching with Uncertainty Cut-offs//. [[Advances in Computer Chess 8]]
* [[Andreas Junghanns]], [[Jonathan Schaeffer]] (**1997**). //Search versus knowledge in game-playing programs revisited//. [[Conferences#IJCAI1997|IJCAI-97]], Vol. 1, [[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.168&rep=rep1&type=pdf|pdf]]
* [[Andreas Junghanns]], [[Jonathan Schaeffer]], [[Mark Brockington]], [[Yngvi Björnsson]], [[Tony Marsland]] (**1997**). //Diminishing Returns for Additional Search in Chess.// [[Advances in Computer Chess 8]], [[http://webdocs.cs.ualberta.ca/~jonathan/Papers/Papers/dim.ps|ps]]
* Andreas Junghanns (**1998**). //Are there Practical Alternatives to Alpha-Beta?// [[ICGA Journal#21_1|ICCA Journal, Vol. 21, No. 1]]
* [[Andreas Junghanns]], [[Jonathan Schaeffer]] (**1998**). //[[http://link.springer.com/chapter/10.1007/3-540-48957-6_1|Relevance Cuts: Localizing the Search.]]//. [[CG 1998]], [[http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=B8906DD9B982AB1B79F0A86C85C6CC61?doi=10.1.1.31.6234&rep=rep1&type=pdf|pdf]] from [[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.6234|CiteSeerX]]
* [[#PushingtheLimits]][[Andreas Junghanns]] (**1999**). //Pushing the Limits: New Developments in Single-Agent Search,// Ph.D. Thesis, Department of Computing Science, [[University of Alberta]]. <ref>[[http://www.cs.ualberta.ca/%7Egames/Sokoban/papers.html|Sokoban Publications]] from [[http://www.cs.ualberta.ca/%7Egames/|GAMES Group]] of the [[University of Alberta]]</ref>
==2000 ...== 
* [[Andreas Junghanns]], [[Jonathan Schaeffer]] (**2000**). //Sokoban: A Challenging Single-Agent Search Problem.// Games in AI Research (eds. [[Jaap van den Herik]] and [[Hiroyuki Iida]]), pp. 139-157. Published by the Universiteit Maastricht in cooperation with the University of Shizuoka. ISBN 90-621-6416-1. [[http://webdocs.cs.ualberta.ca/~jonathan/Papers/Papers/sokoaij.ps|ps]], [[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.2827&rep=rep1&type=pdf|pdf]] from [[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.2827|CiteSeerX]]
* [[Jonathan Schaeffer]], [[Aske Plaat]], [[Andreas Junghanns]] (**2001**). //Unifying Single-agent and Two-player search.// Information Sciences, Vol. 135, pp. 151-175. ISSN 0020-0255. [[http://webdocs.cs.ualberta.ca/~jonathan/Papers/Papers/search.ps|ps]]
* [[Andreas Junghanns]], [[Jonathan Schaeffer]] (**2001**). //Sokoban: Improving the Search with Relevance Cuts//. Theoretical Computer Science, vol. 252, no. 1-2, pp. 151-175, [[http://webdocs.cs.ualberta.ca/~jonathan/Papers/Papers/rc.pdf|pdf]]
* [[Carlos Linares López]], [[Andreas Junghanns]] (**2002**). //[[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_23|Perimeter Search Performance]]//. [[CG 2002]]

=External Links=
* [[http://www.linkedin.com/in/andreasjunghanns|Andreas Junghanns | LinkedIn]]

=References= 
<references />
=What links here?= 
[[include page="Andreas Junghanns" component="backlinks" limit="60"]]
**[[People|Up one level]]**