This page contains publications by my research group, sorted by date. Supervised student or employee names in bold. Download links are given for papers that are available online. Please contact me for other papers.
To do: add links for online versions of some older papers.
D. Silver and G. Tesauro. Monte-carlo simulation balancing. In Danyluk et al., ICML 2009.
R. Sutton, Hamid R. Maei, D. Precup, S. Bhatnagar, D. Silver, C. Szepesvári, and E. Wiewiora. Fast gradient-descent methods for temporal-difference learning with linear function approximation. In Danyluk et al., ICML 2009.
M. Enzenberger and M. Müller. A lock-free multithreaded Monte-Carlo tree search algorithm, 2009. Accepted for ACG12. Acceptance rate: 20/35 = 57%.
D. Tom and M. Müller. A study of UCT and its enhancements, 2009. Accepted for ACG12. Acceptance rate: 20/35 = 57%.
M. Enzenberger and M. Müller. Fuego - an open-source framework for board games and Go engine based on Monte-Carlo tree search. Technical Report TR 09-08, Dept. of Computing Science. University of Alberta, Edmonton, Alberta, Canada, 2009.
M. Müller. Fuego at the Computer Olympiad in Pamplona 2009: a tournament report. Technical Report TR 09-09, Dept. of Computing Science. University of Alberta, Edmonton, Alberta, Canada, 2009.
D. Silver, R. Sutton, and M. Müller. Sample-based learning and search with permanent and transient memories. In W. Cohen, A. McCallum, and S. Roweis, editors, Machine Learning, Proceedings of the Twenty-Fifth International Conference (ICML 2008), volume 307 of ACM International Conference Proceeding Series, pages 968-975, Helsinki, Finland, 2008. ACM. Top tier. Acceptance rate: 158/583 = 27%.
X. Niu and M. Müller. An improved safety solver in Go using partial regions. In J. van den Herik, X. Xu, Z. Ma, and M. Winands, editors, Computer and Games. 6th International Conference, volume 5131 of Lecture Notes in Computer Science, pages 102-112, Beijing, China, 2008. Springer. http://dx.doi.org/10.1007/978-3-540-87608-3_10. Acceptance rate: 24/40 = 60%.
A. Kishimoto and M. Müller. About the completeness of depth-first proof-number search. In J. van den Herik, X. Xu, Z. Ma, and M. Winands, editors, Computer and Games. 6th International Conference, volume 5131 of Lecture Notes in Computer Science, pages 146-156, Beijing, China, 2008. Springer. http://dx.doi.org/10.1007/978-3-540-87608-3_14. Acceptance rate: 24/40 = 60%.
L. Zhao and M. Müller. Using artificial boundaries in the game of Go. In J. van den Herik, X. Xu, Z. Ma, and M. Winands, editors, Computer and Games. 6th International Conference, volume 5131 of Lecture Notes in Computer Science, pages 81-91, Beijing, China, 2008. Springer. http://dx.doi.org/10.1007/978-3-540-87608-3_8. Acceptance rate: 24/40 = 60%.
X. Niu and M. Müller. An open boundary safety-of-territory solver for the game of Go. In J. van den Herik, P. Ciancarini, and H. Donkers, editors, Computer and Games. 5th International Conference, volume 4630 of Lecture Notes in Computer Science, pages 37 - 49, Torino, Italy, 2007. Springer.
A. Botea, M. Müller, and J. Schaeffer. Fast planning with iterative macros. In Twentieth International Joint Conference on Artificial Intelligence (IJCAI), pages 1828-1833, Hyderabad, India, 2007. Acceptance rate (oral presentation): 212/1353 = 15.7%.
D. Silver, R. Sutton, and M. Müller. Reinforcement learning of local shape in the game of Go. In Twentieth International Joint Conference on Artificial Intelligence (IJCAI), pages 1053-1058, Hyderabad, India, 2007. Acceptance rate (oral presentation): 212/1353 = 15.7%.
K. Yoshizoe, A. Kishimoto, and M. Müller. Lambda depth-first proof number search and its application to Go. In Twentieth International Joint Conference on Artificial Intelligence (IJCAI), pages 2404-2409, Hyderabad, India, 2007. Acceptance rate (oral presentation): 212/1353 = 15.7%.
R. Sutton, A. Koop, and D. Silver. On the role of tracking in stationary environments. In Z. Ghahramani (ed.), ICML 2007, pages 871-878.
S. Soeda, K. Yoshizoe, A. Kishimoto, T. Kaneko, T. Tanaka, and M. Müller. Lambda search based on proof and disproof numbers. Information Processing Society of Japan (IPSJ) Journal, 48(11):3455-3462, 2007. In Japanese.
X. Niu, A. Kishimoto, and M. Müller. Recognizing seki in computer Go. In J. van den Herik, S.-C. Hsu, T.-s. Hsu, and H. Donkers, editors, Advances in Computer Games. 11th International Conference, volume 4250 of Lecture Notes in Computer Science, pages 88 - 103. Springer, 2006.
L. Zhao and M. Müller. Solving probabilistic combinatorial games. In J. van den Herik, S.-C. Hsu, T.-s. Hsu, and H. Donkers, editors, Advances in Computer Games. 11th International Conference, volume 4250 of Lecture Notes in Computer Science, pages 225 - 238. Springer, 2006.
A. Kishimoto and M. Müller. A solution to the GHI problem for depth-first proof-number search. Information Sciences, 175(4):296-314, 2005.
A. Botea, M. Enzenberger, M. Müller, and J. Schaeffer. Macro-FF: Improving AI planning with automatically learned macro-operators. Journal of Artificial Intelligence Research, 24:581-621, 2005.
A. Botea, M. Müller, and J. Schaeffer. Learning partial-order macros from solutions. In S. Biundo, K. Myers, and K. Rajan, editors, ICAPS 2005. Proceedings of the 15th International Conference on Automated Planning and Scheduling, pages 231-240, Monterey, California, 2005.A. Kishimoto and M. Müller. Dynamic decomposition search: A divide and conquer approach and its application to the one-eye problem in Go. In IEEE Symposium on Computational Intelligence and Games (CIG'05), pages 164-170, 2005.
A. Kishimoto and M. Müller. Search versus knowledge for solving life and death problems in Go. In Twentieth National Conference on Artificial Intelligence (AAAI-05), pages 1374-1379, 2005.
J. Schaeffer, Y. Björnsson, N. Burch, A. Kishimoto, M. Müller, R. Lake, P. Lu, and S. Sutphen. Solving Checkers. In International Joint Conference on Artificial Intelligence (IJCAI), pages 292-297, 2005.
A. Botea, M. Enzenberger, M. Müller, and J. Schaeffer. Macro-FF, 2004. In booklet of the International Planning Competition (IPC-4). http://ls5-www.cs.uni-dortmund.de/~edelkamp/ipc-4/IPC-4.pdf.
M. Müller. Go-related research at the University of Alberta. In T. Ito and T. Nakamura, editors, The 9th Game Programming Workshop in Japan 2004, pages 22-23, Japan, 2004. IPSJ SIG-GI (Special Interest Group on Game Informatics). Extended abstract.
J. Zhou and M. Müller. Solving systems of difference constraints incrementally with bidirectional search. Algorithmica, 39(3):255-274, 2004.
A. Botea, M. Müller, and J. Schaeffer. Near optimal hierarchical path-finding. Journal of Game Development, 1(1):7-28, 2004.
X. Niu and M. Müller. An improved safety solver for computer Go. In J. van den Herik, Y. Björnsson, and N. Netanyahu, editors, Computers and Games: 4th International Conference, CG 2004, volume 3846 of Lecture Notes in Computer Science, pages 97-112, Ramat-Gan, Israel, 2006. Springer.
M. Müller and Z. Li. Locally informed global search for sums of combinatorial games. In J. van den Herik, Y. Björnsson, and N. Netanyahu, editors, Computers and Games: 4th International Conference, CG 2004, volume 3846 of Lecture Notes in Computer Science, pages 273-284, Ramat-Gan, Israel, 2006. Springer.
A. Kishimoto and M. Müller. A general solution to the graph history interaction problem. In Nineteenth National Conference on Artificial Intelligence (AAAI 2004), pages 644-649, San Jose, CA, 2004.
M. Müller, M. Enzenberger, and J. Schaeffer. Temperature discovery search. In Nineteenth National Conference on Artificial Intelligence (AAAI 2004), pages 658-663, San Jose, CA, 2004.
L. Zhao and M. Müller. Game-SAT: A preliminary report. In Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), pages 357-362, Vancouver, Canada, 2004.
A. Botea, M. Müller, and J. Schaeffer. Using component abstraction for automatic generation of macro-actions. In S. Zilberstein, J. Koehler, and S. Koenig, editors, ICAPS 2004. Proceedings of the 14th International Conference on Automated Planning and Scheduling, pages 181-190, Whistler, Canada, 2004.
A. Kishimoto and M. Müller. Df-pn in Go: an application to the one-eye problem. In J. van den Herik, H. Iida, and E. Heinz, editors, Advances in Computer Games 10, pages 125 - 141. Kluwer, 2004.
X. Niu. Recognizing safe territories and stones in computer Go. Master's thesis, University of Alberta, 2004.
L. Zhao. Tackling Post's correspondence problem. 22 pages. Accepted 2/2004 for Journal of Experimental Algorithmics but still not published...
Jonathan Schaeffer, Martin Müller, and Yngvi Björnsson, editors. Computers and Games, Third International Conference, CG 2002, Edmonton, Canada, July 25-27, 2002, Revised Papers, volume 2883 of Lecture Notes in Computer Science. Springer, 2003.
J. Zhou and M. Müller. Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs. Information Processing Letters, 88(4):195-200, 2003.
J. Zhou. Incremental search algorithms. Master's thesis, University of Alberta, 2003.
M. Müller. Conditional combinatorial games, and their application to analyzing capturing races in Go. Information Sciences, 154(3-4):189-202, 2003.
M. Müller. Proof-set search. In J. Schaeffer, M. Müller, and Y. Björnsson, editors, Computers and Games 2002, number 2883 in Lecture Notes in Computer Science, pages 88-107. Springer Verlag, 2003.
A. Botea, M. Müller, and J. Schaeffer. Using abstraction for planning in Sokoban. In J. Schaeffer, M. Müller, and Y. Björnsson, editors, Computers and Games 2002, number 2883 in Lecture Notes in Computer Science, pages 360-375. Springer Verlag, 2003.
A. Botea, M. Müller, and J. Schaeffer. Extending PDDL for hierarchical planning and topological abstraction. In iCAPS workshop on PDDL, pages 25-32, 2003.
A. Botea. Reducing planning complexity with topological abstraction. Proceedings of the International Conference on Automated Planning & Scheduling (ICAPS-03) Doctoral Consortium, Trento, Italy, 2003.
L. Zhao. Tackling Post's correspondence problem. In J. Schaeffer, M. Müller, and Y. Björnsson, editors, Computers and Games 2002, number 2883 in Lecture Notes in Computer Science, pages 326-344. Springer Verlag, 2003.
A. Kishimoto and M. Müller. A solution to the GHI problem for depth-first proof-number search. In Proceedings of the 7th Joint Conference on Information Sciences JCIS 2003, pages 489 - 492, 2003.
A. Botea. Using abstraction for heuristic search and planning. In S. Koenig and R. Holte, editors, 5th International Symposium on Abstraction, Reformulation, and Approximation, number 2371 in Lecture Notes in Computer Science, pages 326-327. Springer Verlag, 2002.
N. Bullock. Domineering: Solving large combinatorial search spaces. ICGA Journal, 25(2):67-84, 2002.
N. Bullock. Domineering: Solving large combinatorial search spaces. Master's thesis, University of Alberta, 2002.
M. Müller. Counting the score: Position evaluation in computer Go. ICGA Journal, 25(4):219-228, 2002.
M. Müller. A generalized framework for analyzing capturing races in Go. In Proceedings of Sixth Joint Conference on Information Sciences (JCIS 2002), pages 469-472, 2002.
M. Müller. Multicriteria evaluation in computer game-playing, and its relation to AI planning. In B. Drabble, J. Koehler, and J. Refanidis, editors, Proceedings of Sixth International Conference on AI Planning & Scheduling (AIPS-2002) Workshop on Planning and Scheduling using Multiple Criteria, pages 1-6, Toulouse, France, 2002.
M. Müller and T. Tegos. Experiments in Computer Amazons. In R. Nowakowski, editor, More Games of No Chance, pages 243-260. Cambridge University Press, 2002.
T. Tegos. Shooting the last arrow. Master's thesis, University of Alberta, 2002.
L. Zhao. Solving and creating difficult instances of Post's correspondence problem. Master's thesis, University of Alberta, 2002.
M. Müller. Computer Go. Artificial Intelligence, 134(1-2):145-179, 2002.
M. Müller. Solving 5x5 Amazons. In The 6th Game Programming Workshop (GPW 2001), number 14 in IPSJ Symposium Series Vol.2001, pages 64-71, Hakone (Japan), 2001.
M. Müller. Proof Set Search. Revised and improved version of previous report listed below. Technical report, University of Alberta TR01-09. 23 pages.
M. Müller. Global and local game tree search. Information Sciences, 135(3-4):187-206, 2001.
M. Müller. Review: Computer Go 1984 - 2000. In T. Marsland and I. Frank, editors, Computers and Games 2000, number 2063 in Lecture Notes in Computer Science, pages 426-435. Springer Verlag, 2001.
M. Müller. Partial Order Bounding: A new Approach to Evaluation in Game Tree Search. Artificial Intelligence Journal, 129(1-2), 279-311, 2001.
M. Müller. Generalized Thermography: A new approach to evaluation in computer Go. In J. van den Herik and H. Iida, editors, Games in AI Research, pages 203-219, Maastricht 2000, Universiteit Maastricht. First published in Iida, H. (Ed.), Proceedings IJCAI-97 Workshop on Using Games as an Experimental Testbed for AI Research, pages 41-49, Nagoya, 1997.
M. Müller. Not like other games - why tree search in Go is different. In Proceedings of Fifth Joint Conference on Information Sciences (JCIS 2000), pages 974-977, 2000. Extended abstract, invited paper for special session on Heuristic Search and Computer Game Playing.
H. Iida and M. Müller. Report on the Second Open Computer-Amazons Championship. ICGA Journal Vol.23 No.1, March 2000.
M. Müller. Decomposition search: A combinatorial games approach to game tree search, with applications to solving Go endgames. In IJCAI-99, volume 1, pages 578-583, 1999.
M. Müller. Race to capture: Analyzing semeai in Go. In Game Programming Workshop in Japan '99, volume 99(14) of IPSJ Symposium Series, pages 61-68, 1999.
M. Müller. Computer Go: A research agenda. ICCA Journal, 22(2):104-112, 1999. A version of the 1998 Computers and Games paper adapted for readers with background in games other than Go.
M. Müller. Proof-set search. Technical Report TR-99-20, Electrotechnical Laboratory, Tsukuba, Japan, 1999. An early version of the Computers and Games 2002 paper above.
M. Müller. Partial order bounding: Using partial order evaluation in game tree search. Technical Report TR-99-12, Electrotechnical Laboratory, Tsukuba, Japan, 1999. An early version of the AI Journal paper above.
M. Müller. Partial Order Evaluation in Game Tree Search, and its Application to Analyzing Semeai in the Game of Go. Workshop on Search Techniques for Problem Solving Under Uncertainty and Incomplete Information, Weixiong Zhang and Sven Koenig, Cochairs, AAAI 1999 Spring Symposium Series, 101--106, AAAI, 1999.
N. Sanechika, M. Tajima, and M. Müller. Observable definitions of fuseki concepts (extended abstract, in Japanese). In Game Programming Workshop in Japan '99, volume 99(14) of IPSJ Symposium Series, pages 117-120, 1999.
M. Müller. Computer Go: A research agenda. In J. van den Herik and H. Iida, editors, Computers and Games, number 1558 in Lecture Notes in Computer Science, pages 252-264. Springer Verlag, 1998.
M. Müller. Generalized thermography: A new approach to evaluation in computer Go. In H. Iida, editor, IJCAI-97 Workshop on Using Games as an Experimental Testbed for AI Research, pages 41-49, Nagoya, 1997. Proceedings published as a book Games in AI Research.
M. Müller. Playing it safe: Recognizing secure territories in computer Go by using static rules and search. In H. Matsubara, editor, Game Programming Workshop in Japan '97, pages 80-86, Computer Shogi Association, Tokyo, Japan, 1997.
M. Müller and R. Gasser. Experiments in computer Go endgames. In R. Nowakowski, editor, Games of No Chance, pages 273-284. Cambridge University Press, 1996.
M. Müller, E. Berlekamp, and B. Spight. Generalized thermography: Algorithms, implementation, and application to Go endgames. Technical Report 96-030, ICSI Berkeley, 1996.
D. Fotland, M. Müller, and B. Wilcox. An evening with the computer Go programmers: David Fotland, Martin Müller, Bruce Wilcox speak at the San Francisco Go club. Videotape, American Ing Goe, 1996.
M. Müller. Computer Go as a Sum of Local Games: An Application of Combinatorial Game Theory. PhD thesis, ETH Zürich, 1995. Diss. ETH Nr. 11.006.
M. Müller. Game theories and computer Go. In Proc. of the Go and Computer Science Workshop (GCSW'93), Sophia-Antipolis, 1993. INRIA.
A. Kierulf, R. Gasser, P. Geiser, M. Müller, and J. Nievergelt. Every interactive system evolves into hyperspace: The case of the Smart Game Board. In H. Maurer, editor, Proc. Hypertext/Hypermedia 1991, pages 174-180, New York, 1991. Springer Verlag.
M. Müller. Pattern matching in Explorer. Extended abstract. In Proceedings of the Game Playing System Workshop, pages 1-3, Tokyo, Japan, 1991. ICOT.
M. Müller. Measuring the performance of Go programs. In International Go Congress, Beijing, 1991.
M. Müller. 1990 International Computer Go Congress. Computer Go, 15:3-5, 1991. A tournament report.
M. Müller. The Smart Game Board as a tool for game programmers. In D.N.L. Levy and D.F. Beal, editors, Heuristic Programming in Artificial Intelligence 2, pages 217-231. Ellis Horwood, London, 1990.
K. Chen, A. Kierulf, M. Müller, and J. Nievergelt. The Design and Evolution of Go Explorer. In T. A. Marsland and J. Schaeffer, editors, Computers, Chess, and Cognition, pages 271-285. Springer Verlag, New York, 1990.
M. Müller. The 1990 European summer tournaments. Computer Go, 14:6-7, 1990. A tournament report.
M. Müller. Eine Theoretische Basis zur Programmierung von Go. (A theoretical basis for programming Go.) Diplomarbeit, Technische Universität Graz, 1989.
M. Müller. 1989 European Computer Go Championship. Computer Go, 11:8-9, 1989. A tournament report.
Martin Müller