Martin Müller

Home * People * Martin Müller



Martin Müller, an Austrian computer scientist, researcher, since 2000 associate professor, and since 2009 full professor at University of Alberta. Martin Müller's academical career included the Graz University of Technology, Jürg Nievergelt's group at ETH Zurich, University of California, Berkeley, ETL (Electrotechnical Laboratory) at University of Tsukuba and the NTT, Atsugi, Japan. His research interests focus on game-tree search and two-player games, including computer Go, Monte-Carlo tree search, depth-first proof-number search and graph history interaction (GHI). He worked within the team of Jonathan Schaeffer on solving Checkers , and more recently with Ryan Hayward on the game of Hex.

=Programs= Martin Müller is co-author of two successful Go programs. The veteran program Explorer was developed along with Anders Kierulf and Ken Chen and played eight Computer Olympiads from 1989 until 2005, two times winning Gold medals. His new program Fuego, co-authored by Markus Enzenberger, Broderick Arneson, Richard Segal, Gerald Tesauro and Arpad Rimmel (since 2010), won the Gold medal at the 14th Computer Olympia in 9x9 Go, as well the Silver medal in 19x19 Go . He has further competed in Amazons and is member of the Wolve team in Hex.

=Selected Publications=

1989

 * Martin Müller (1989). Eine Theoretische Basis zur Programmierung von Go. (A theoretical basis for programming Go.) Diplomarbeit, Graz University of Technology

1990 ...

 * Ken Chen, Anders Kierulf, Martin Müller, Jürg Nievergelt (1990). The Design and Evolution of Go Explorer. Computers, Chess, and Cognition
 * Martin Müller (1991). The Smart Game Board as a Tool for Game Programmers. Heuristic Programming in AI 2 » Smart Game Board

1995 ...

 * Martin Müller (1995). Computer Go as a Sum of Local Games: An Application of Combinatorial Game Theory. Ph.D. Thesis. ETH Zurich, Switzerland. zipped pdf
 * Martin Müller, Elwyn Berlekamp, Bill Spight (1996). Generalized thermography: Algorithms, implementation, and application to Go endgames. Technical Report 96-030, ICSI Berkeley, 1996. postscript
 * Martin Müller, Ralph Gasser (1996). Experiments in Computer Go Endgames. Games of No Chance edited by Richard J. Nowakowski
 * Martin Müller (1998). Computer Go: A Research Agenda. CG 1998

2000 ...
2001 2002 2003 2004
 * Martin Müller (2000). Review: Computer Go 1984–2000. CG 2000
 * Hiroyuki Iida, Martin Müller (2000). Report on the Second Open Computer-Amazons Championship. ICGA Journal, Vol 23, No. 1
 * Jack van Rijswijck, Martin Müller (2001). The Second International Conference on Computers and Games. ICCA Journal, Vol. 24, No. 1 » CG 2000
 * Martin Müller (2001). Solving 5x5 Amazons. 6th Game Programming Workshop
 * Martin Müller (2001). Proof-Set Search. Technical Report TR 01-09, University of Alberta
 * Martin Müller (2002). Proof-Set Search. CG 2002
 * Adi Botea, Martin Müller, Jonathan Schaeffer (2002). Using Abstraction for Planning in Sokoban. CG 2002
 * Martin Müller, Theodore Tegos (2002). Experiments in Computer Amazons. More Games of No Chance edited by Richard J. Nowakowski
 * Martin Müller (2002). Position Evaluation in Computer Go. ICGA Journal, Vol. 25, No. 4
 * Akihiro Kishimoto, Martin Müller. (2003). Df-pn in Go: An Application to the One-Eye Problem. Advances in Computer Games 10
 * Xiaozhen Niu, Martin Müller (2004). An Improved Safety Solver for Computer Go. CG 2004
 * Martin Müller, Zhichao Li (2004). Locally Informed Global Search for Sums of Combinatorial Games. CG 2004
 * Adi Botea, Martin Müller, Jonathan Schaeffer (2004). Near Optimal Hierarchical Path-Finding. In Journal of Game Development, Vol. 1, No.1
 * Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer (2004). Macro-FF. In Booklet of 4th International Planning Competition
 * Akihiro Kishimoto, Martin Müller (2004). A General Solution to the Graph History Interaction Problem. AAAI 2004
 * Martin Müller, Markus Enzenberger, Jonathan Schaeffer (2004). Temperature Discovery Search. AAAI 2004
 * Ling Zhao, Martin Müller (2004). Game-SAT: A Preliminary Report. SAT 2004

2005 ...
2006 2007 2008 2009
 * Xiaozhen Niu, Akihiro Kishimoto, Martin Müller (2005). Recognizing Seki in Computer Go. Advances in Computer Games 11
 * Ling Zhao, Martin Müller (2005). Solving Probabilistic Combinatorial Games. Advances in Computer Games 11
 * Akihiro Kishimoto, Martin Müller (2005). A Solution to the GHI Problem for Depth-First Proof-Number Search. 7th Joint Conference on Information Sciences
 * Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer (2005). Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. Journal of Artificial Intelligence Research, Vol. 24
 * Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Rob Lake, Paul Lu, Steve Sutphen (2005). Solving Checkers. IJCAI 2005
 * Xiaozhen Niu, Martin Müller (2006). An Open Boundary Safety-of-Territory Solver for the Game of Go. CG 2006
 * David Silver, Richard Sutton, Martin Müller (2007). Reinforcement learning of local shape in the game of Go. IJCAI 2007
 * Kazuki Yoshizoe, Akihiro Kishimoto, Martin Müller (2007). Lambda Depth-First Proof-Number Search and Its Application to Go. IJCAI 2007
 * Jonathan Schaeffer, Neil Burch, Yngvi Björnsson, Akihiro Kishimoto, Martin Müller, Rob Lake, Paul Lu, Steve Sutphen (2007). Checkers is Solved. Science, Vol. 317, no. 5844
 * Ling Zhao, Martin Müller (2008). Using Artificial Boundaries in the Game of Go. CG 2008
 * Xiaozhen Niu, Martin Müller (2008). An Improved Safety Solver in Go Using Partial Regions. CG 2008
 * Akihiro Kishimoto, Martin Müller (2008). About the Completeness of Depth-First Proof-Number Search. CG 2008
 * David Silver, Richard Sutton, Martin Müller (2008). Sample-Based Learning and Search with Permanent and Transient Memories. In Proceedings of the 25th International Conference on Machine Learning
 * Markus Enzenberger, Martin Müller (2009). A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm. Advances in Computer Games 12, pdf
 * Markus Enzenberger, Martin Müller (2009). Fuego - An Open-source Framework for Board Games and Go Engine Based on Monte-Carlo Tree Search. Technical Report TR 09-08, University of Alberta
 * Martin Müller (2009). Fuego at the Computer Olympiad in Pamplona 2009: A Tournament Report. Technical Report TR 09-09, University of Alberta

2010 ...

 * Markus Enzenberger, Martin Müller, Broderick Arneson, Richard Segal (2011). Fuego - An Open-source Framework for Board Games and Go Engine Based on Monte-Carlo Tree Search. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 2, No. 4, pdf
 * Gabriel Van Eyck, Martin Müller (2011). Revisiting Move Groups in Monte-Carlo Tree Search. Advances in Computer Games 13
 * Henry Brausen, Ryan B. Hayward, Martin Müller, Abdul Qadir, David Spies (2011). Blunder Cost in Go and Hex. Advances in Computer Games 13
 * Akihiro Kishimoto, Mark Winands, Martin Müller, Jahn-Takeshi Saito (2012). Game-Tree Search using Proof Numbers: The First Twenty Years. ICGA Journal, Vol. 35, No. 3
 * Shih-Chieh Huang, Martin Müller (2013).  Investigating the Limits of Monte Carlo Tree Search Methods in Computer Go. CG 2013
 * Shih-Chieh Huang, Broderick Arneson, Ryan Hayward, Martin Müller, Jakub Pawlewicz (2013). MoHex 2.0: a pattern-based MCTS Hex player. CG 2013
 * Sumudo Fernando, Martin Müller (2013). Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go. CG 2013
 * David Silver, Richard Sutton, Martin Müller (2013). Temporal-Difference Search in Computer Go. Proceedings of the ICAPS-13 Workshop on Planning and Learning

2015 ...

 * Jiaxing Song, Martin Müller (2015). An Enhanced Solver for the Game of Amazons. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 7, No. 1
 * Martin Müller (2015). Keynote speech III Computer go research - The challenges ahead. CIG 2015
 * Chenjun Xiao, Martin Müller (2016). Factorization Ranking Model for Move Prediction in the Game of Go. AAAI 2016
 * Chao Gao, Martin Müller, Ryan Hayward (2017). Focused Depth-first Proof Number Search using Convolutional Neural Networks for the Game of Hex. IJCAI 2017
 * Chenjun Xiao, Jincheng Mei, Martin Müller (2018). Memory-Augmented Monte Carlo Tree Search. AAAI 2018
 * Chao Gao, Martin Müller, Ryan Hayward (2018). Three-Head Neural Network Architecture for Monte Carlo Tree Search. IJCAI 2018
 * Chao Gao, Siqi Yan, Ryan Hayward, Martin Müller (2018). A transferable neural network for Hex. CG 2018, ICGA Journal, Vol. 40, No. 3

2020 ...

 * Rejwana Haque, Ting Han Wei, Martin Müller (2021). On the Road to Perfection? Evaluating Leela Chess Zero Against Endgame Tablebases. Advances in Computer Games 17

=External Links=
 * Martin Müller - University of Alberta
 * Martin Müller Homepage
 * Computer Go Research
 * Martin Müller's ICGA Tournaments
 * Martin Müller - The Mathematics Genealogy Project
 * AIs Have Mastered Chess. Will Go Be Next? by Jonathan Schaeffer, Martin Müller & Akihiro Kishimoto, IEEE Spectrum, June 25, 2014

=References= Up one level