Every Interactive System Evolves into Hyperspace: The Case of the Smart Game Board. - Anders Kierulf; Ralph Gasser; Peter M. Geiser; Martin Müller 003; Jürg Nievergelt; Christoph Wirth (Hypertext/Hypermedia, 1991)

Decomposition Search: A Combinatorial Games Approach to Game Tree Search, with Applications to Solving Go Endgames. - Martin Müller 003 (IJCAI, 1999)

Computer Go: A Research Agenda. - Martin Müller 003 (J. Int. Comput. Games Assoc., 1999)

Review: Computer Go 1984-2000. - Martin Müller 003 (Computers and Games, 2000)

Report on the second Open Computer-Amazons Championship. - Hiroyuki Iida; Martin Müller 003 (J. Int. Comput. Games Assoc., 2000)

Partial order bounding: A new approach to evaluation in game tree search. - Martin Müller 003 (Artif. Intell., 2001)

Global and local game tree search. - Martin Müller 003 (Inf. Sci., 2001)

Using Abstraction for Planning in Sokoban. - Adi Botea; Martin Müller 003; Jonathan Schaeffer 001 (Computers and Games, 2002)

Proof-Set Search. - Martin Müller 003 (Computers and Games, 2002)

A Generalized Framework for Analyzing Capturing Races in Go. - Martin Müller 003 (JCIS, 2002)

Computer Go. - Martin Müller 003 (Artif. Intell., 2002)

Position Evaluation in Computer Go. - Martin Müller 003 (J. Int. Comput. Games Assoc., 2002)

DF-PN in Go: An Application to the One-Eye Problem. - Akihiro Kishimoto; Martin Müller 003 (ACG, 2003)

Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs. - Jianjun Zhou; Martin Müller 003 (Inf. Process. Lett., 2003)

Conditional combinatorial games and their application to analyzing capturing races in Go. - Martin Müller 003 (Inf. Sci., 2003)

A General Solution to the Graph History Interaction Problem. - Akihiro Kishimoto; Martin Müller 003 (AAAI, 2004)

Temperature Discovery Search. - Martin Müller 003; Markus Enzenberger; Jonathan Schaeffer 001 (AAAI, 2004)

Using Component Abstraction for Automatic Generation of Macro-Actions. - Adi Botea; Martin Müller 003; Jonathan Schaeffer 001 (ICAPS, 2004)

Locally Informed Global Search for Sums of Combinatorial Games. - Martin Müller 003; Zhichao Li (Computers and Games, 2004)

An Improved Safety Solver for Computer Go. - Xiaozhen Niu; Martin Müller 003 (Computers and Games, 2004)

Game-SAT: A Preliminary Report. - Ling Zhao; Martin Müller 003 (SAT, 2004)

Solving Systems of Difference Constraints Incrementally with Bidirectional Search. - Jianjun Zhou; Martin Müller 003 (Algorithmica, 2004)

Near Optimal Hierarchical Path-Finding. - Adi Botea; Martin Müller 003; Jonathan Schaeffer 001 (J. Game Dev., 2004)

Search versus Knowledge for Solving Life and Death Problems in Go. - Akihiro Kishimoto; Martin Müller 003 (AAAI, 2005)

Learning Partial-Order Macros from Solutions. - Adi Botea; Martin Müller 003; Jonathan Schaeffer 001 (ICAPS, 2005)

Dynamic Decomposition Search: A Divide and Conquer Approach and its Application to the One-Eye Problem in Go. - Akihiro Kishimoto; Martin Müller 003 (CIG, 2005)

Solving Checkers. - Jonathan Schaeffer 001; Yngvi Björnsson; Neil Burch; Akihiro Kishimoto; Martin Müller 003; Robert Lake; Paul Lu; Steve Sutphen (IJCAI, 2005)

A solution to the GHI problem for depth-first proof-number search. - Akihiro Kishimoto; Martin Müller 003 (Inf. Sci., 2005)

Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. - Adi Botea; Markus Enzenberger; Martin Müller 003; Jonathan Schaeffer 001 (J. Artif. Intell. Res., 2005)

Recognizing Seki in Computer Go. - Xiaozhen Niu; Akihiro Kishimoto; Martin Müller 003 (ACG, 2006)

Solving Probabilistic Combinatorial Games. - Ling Zhao; Martin Müller 003 (ACG, 2006)

An Open Boundary Safety-of-Territory Solver for the Game of Go. - Xiaozhen Niu; Martin Müller 003 (Computers and Games, 2006)

Fast Planning with Iterative Macros. - Adi Botea; Martin Müller 003; Jonathan Schaeffer 001 (IJCAI, 2007)

Reinforcement Learning of Local Shape in the Game of Go. - David Silver; Richard S. Sutton; Martin Müller 003 (IJCAI, 2007)

Lambda Depth-First Proof Number Search and Its Application to Go. - Kazuki Yoshizoe; Akihiro Kishimoto; Martin Müller 003 (IJCAI, 2007)

About the Completeness of Depth-First Proof-Number Search. - Akihiro Kishimoto; Martin Müller 003 (Computers and Games, 2008)

An Improved Safety Solver in Go Using Partial Regions. - Xiaozhen Niu; Martin Müller 003 (Computers and Games, 2008)

Using Artificial Boundaries in the Game of Go. - Ling Zhao; Martin Müller 003 (Computers and Games, 2008)

Sample-based learning and search with permanent and transient memories. - David Silver; Richard S. Sutton; Martin Müller 003 (ICML, 2008)

A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm. - Markus Enzenberger; Martin Müller 003 (ACG, 2009)

A Study of UCT and Its Enhancements in an Artificial Game. - David Tom; Martin Müller 003 (ACG, 2009)

Monte-Carlo Exploration for Deterministic Planning. - Hootan Nakhost; Martin Müller 003 (IJCAI, 2009)

Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement. - Hootan Nakhost; Martin Müller 003 (ICAPS, 2010)

Computational Experiments with the RAVE Heuristic. - David Tom; Martin Müller 003 (Computers and Games, 2010)

Automating Layouts of Sewers in Subdivisions. - Neil Burch; Robert C. Holte; Martin Müller 003; David O'Connell; Jonathan Schaeffer 001 (ECAI, 2010)

Improving Local Search for Resource-Constrained Planning. - Hootan Nakhost; Jörg Hoffmann 001; Martin Müller 003 (SOCS, 2010)

Fuego - An Open-Source Framework for Board Games and Go Engine Based on Monte Carlo Tree Search. - Markus Enzenberger; Martin Müller 003; Broderick Arneson; R. Segal (IEEE Trans. Comput. Intell. AI Games, 2010)

Special Issue on Monte Carlo Techniques and Computer Go. - Chang-Shing Lee; Martin Müller 003; Olivier Teytaud (IEEE Trans. Comput. Intell. AI Games, 2010)

A Local Monte Carlo Tree Search Approach in Deterministic Planning. - Fan Xie 001; Hootan Nakhost; Martin Müller 003 (AAAI, 2011)

Blunder Cost in Go and Hex. - Henry Brausen; Ryan B. Hayward; Martin Müller 003; Abdul Qadir; David Spies (ACG, 2011)

Revisiting Move Groups in Monte-Carlo Tree Search. - Gabriel Van Eyck; Martin Müller 003 (ACG, 2011)

Resource-Constrained Planning: A Monte Carlo Random Walk Approach. - Hootan Nakhost; Jörg Hoffmann 001; Martin Müller 003 (ICAPS, 2012)

Planning Via Random Walk-Driven Local Search. - Fan Xie 001; Hootan Nakhost; Martin Müller 003 (ICAPS, 2012)

ArvandHerd: Parallel Planning with a Portfolio. - Richard Anthony Valenzano; Hootan Nakhost; Martin Müller 003; Jonathan Schaeffer 001; Nathan R. Sturtevant (ECAI, 2012)

Automatically Configuring Algorithms for Scaling Performance. - James Styles; Holger H. Hoos; Martin Müller 003 (LION, 2012)

A Theoretical Framework for Studying Random Walk Planning. - Hootan Nakhost; Martin Müller 003 (SOCS, 2012)

Game-Tree Search Using Proof Numbers: The First Twenty Years. - Akihiro Kishimoto; Mark H. M. Winands; Martin Müller 003; Jahn-Takeshi Saito (J. Int. Comput. Games Assoc., 2012)

Temporal-difference search in computer Go. - David Silver; Richard S. Sutton; Martin Müller 003 (Mach. Learn., 2012)

Better Time Constrained Search via Randomization and Postprocessing. - Fan Xie 001; Richard Anthony Valenzano; Martin Müller 003 (ICAPS, 2013)

Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go. - Sumudu Fernando; Martin Müller 003 (Computers and Games, 2013)

Investigating the Limits of Monte-Carlo Tree Search Methods in Computer Go. - Shih-Chieh Huang; Martin Müller 003 (Computers and Games, 2013)

MoHex 2.0: A Pattern-Based MCTS Hex Player. - Shih-Chieh Huang; Broderick Arneson; Ryan B. Hayward; Martin Müller 003; Jakub Pawlewicz (Computers and Games, 2013)

Towards a Second Generation Random Walk Planner: An Experimental Exploration. - Hootan Nakhost; Martin Müller 003 (IJCAI, 2013)

Adding Local Exploration to Greedy Best-First Search in Satisficing Planning. - Fan Xie 001; Martin Müller 003; Robert Holte (AAAI, 2014)

Type-Based Exploration with Multiple Search Queues for Satisficing Planning. - Fan Xie 001; Martin Müller 003; Robert Holte; Tatsuya Imai (AAAI, 2014)

Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions. - Gaojian Fan; Martin Müller 003; Robert Holte (SOCS, 2014)

Towards a theory of random walk planning: Regress factors, fair homogeneous graphs and extensions. - Hootan Nakhost; Martin Müller 003 (AI Commun., 2014)

TDS+: Improving Temperature Discovery Search. - Yeqin Zhang; Martin Müller 003 (AAAI, 2015)

Understanding and Improving Local Exploration for GBFS. - Fan Xie 001; Martin Müller 003; Robert Holte (ICAPS, 2015)

Keynote speech III: Computer go research - The challenges ahead. - Martin Müller 003 (CIG, 2015)

An Enhanced Solver for the Game of Amazons. - Jiaxing Song; Martin Müller 003 (IEEE Trans. Comput. Intell. AI Games, 2015)

Factorization Ranking Model for Move Prediction in the Game of Go. - Chenjun Xiao; Martin Müller 003 (AAAI, 2016)

Integrating Factorization Ranked Features in MCTS: An Experimental Study. - Chenjun Xiao; Martin Müller 003 (CGW@IJCAI, 2016)

The Two-Edged Nature of Diverse Action Costs. - Gaojian Fan; Martin Müller 003; Robert Holte (ICAPS, 2017)

Structured Best Arm Identification with Fixed Confidence. - Ruitong Huang; Mohammad M. Ajallooeian; Csaba Szepesvári; Martin Müller 003 (ALT, 2017)

Additive Merge-and-Shrink Heuristics for Diverse Action Costs. - Gaojian Fan; Martin Müller 003; Robert Holte (IJCAI, 2017)

Focused Depth-first Proof Number Search using Convolutional Neural Networks for the Game of Hex. - Chao Gao; Martin Müller 003; Ryan Hayward (IJCAI, 2017)

Preliminary Results on Exploration-Driven Satisfiability Solving. - Md. Solimul Chowdhury; Martin Müller 003; Jia-Huai You (AAAI, 2018)

Memory-Augmented Monte Carlo Tree Search. - Chenjun Xiao; Jincheng Mei; Martin Müller 003 (AAAI, 2018)

MS-Lite: A Lightweight, Complementary Merge-and-Shrink Method. - Gaojian Fan; Robert Holte; Martin Müller 003 (ICAPS, 2018)

Adversarial Policy Gradient for Alternating Markov Games. - Chao Gao; Martin Müller 003; Ryan Hayward (ICLR (Workshop), 2018)

Three-Head Neural Network Architecture for Monte Carlo Tree Search. - Chao Gao; Martin Müller 003; Ryan Hayward (IJCAI, 2018)

Analyzing the Impact of Knowledge and Search in Monte Carlo Tree Search in Go. - Farhad Haqiqat; Martin Müller 003 (CGW@IJCAI, 2018)

A transferable neural network for Hex. - Chao Gao; Siqi Yan; Ryan Hayward; Martin Müller 003 (J. Int. Comput. Games Assoc., 2018)

Move Prediction Using Deep Convolutional Neural Networks in Hex. - Chao Gao; Ryan Hayward; Martin Müller 003 (IEEE Trans. Games, 2018)

Guest Editorial Special Issue on Deep/Reinforcement Learning and Games. - I-Chen Wu; Chang-Shing Lee; Yuandong Tian; Martin Müller 003 (IEEE Trans. Games, 2018)

Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics. - Md. Solimul Chowdhury; Martin Müller 003; Jia-Huai You (CP, 2019)

On Principled Entropy Exploration in Policy Optimization. - Jincheng Mei; Chenjun Xiao; Ruitong Huang; Dale Schuurmans; Martin Müller 003 (IJCAI, 2019)

Maximum Entropy Monte-Carlo Planning. - Chenjun Xiao; Ruitong Huang; Jincheng Mei; Dale Schuurmans; Martin Müller 003 (NeurIPS, 2019)

Characterization of Glue Variables in CDCL SAT Solving. - Md. Solimul Chowdhury; Martin Müller 003; Jia-Huai You (CoRR, 2019)

Learning to Combat Compounding-Error in Model-Based Reinforcement Learning. - Chenjun Xiao; Yifan Wu; Chen Ma; Dale Schuurmans; Martin Müller 003 (CoRR, 2019)

Computer Go. - Kazuki Yoshizoe; Martin Müller 003 (Encyclopedia of Computer Graphics and Games, 2019)

Guiding CDCL SAT Search via Random Exploration amid Conflict Depression. - Md. Solimul Chowdhury; Martin Müller 003; Jia-Huai You (AAAI, 2020)

On the Road to Perfection? Evaluating Leela Chess Zero Against Endgame Tablebases. - Rejwana Haque; Ting-Han Wei; Martin Müller 003 (ACG, 2021)

Predicting Human Card Selection in Magic: The Gathering with Contextual Preference Ranking. - Timo Bertram; Johannes Fürnkranz; Martin Müller 003 (CoG, 2021)

The Machine Reconnaissance Blind Chess Tournament of NeurIPS 2022. - Ryan W. Gardner; Gino Perrotta; Anvay Shah; Shivaram Kalyanakrishnan; Kevin A. Wang; Gregory Clark; Timo Bertram; Johannes Fürnkranz; Martin Müller 003; Brady P. Garrison; Prithviraj Dasgupta; Saeid Rezaei (NeurIPS (Competition and Demos), 2021)

A Deep Dive into Conflict Generating Decisions. - Md. Solimul Chowdhury; Martin Müller 003; Jia-Huai You (CoRR, 2021)

A Comparison of Contextual and Non-Contextual Preference Ranking for Set Addition Problems. - Timo Bertram; Johannes Fürnkranz; Martin Müller 003 (CoRR, 2021)

A Simple Unified Framework for Anomaly Detection in Deep Reinforcement Learning. - Hongming Zhang 003; Ke Sun 013; Bo Xu 002; Linglong Kong; Martin Müller 003 (CoRR, 2021)

Improving Search in Go Using Bounded Static Safety. - Owen Randall; Ting-Han Wei; Ryan Hayward; Martin Müller 003 (CG, 2022)

Supervised and Reinforcement Learning from Observations in Reconnaissance Blind Chess. - Timo Bertram; Johannes Fürnkranz; Martin Müller 003 (CoG, 2022)

Quantity vs Quality: Investigating the Trade-Off between Sample Size and Label Reliability. - Timo Bertram; Johannes Fürnkranz; Martin Müller 003 (CoRR, 2022)

Solving NoGo on Small Rectangular Boards. - Haoyu Du; Ting-Han Wei; Martin Müller 003 (ACG, 2023)

Stockfish or Leela Chess Zero? A Comparison Against Endgame Tablebases. - Quazi Asif Sadmine; Asmaul Husna; Martin Müller 003 (ACG, 2023)

Weighting Information Sets with Siamese Neural Networks in Reconnaissance Blind Chess. - Timo Bertram; Johannes Fürnkranz; Martin Müller 003 (CoG, 2023)

Deep Dive on Checkers Endgame Data. - Jiuqi Wang; Martin Müller 003; Jonathan Schaeffer 001 (CoG, 2023)

Replay Memory as An Empirical MDP: Combining Conservative Estimation with Experience Replay. - Hongming Zhang 003; Chenjun Xiao; Han Wang; Jun Jin 001; Bo Xu 002; Martin Müller 003 (ICLR, 2023)

Monte Carlo Tree Search in the Presence of Transition Uncertainty. - Farnaz Kohankhaki; Kiarash Aghakasiri; Hongming Zhang 003; Ting-Han Wei; Chao Gao; Martin Müller 003 (AAAI, 2024)

Solving Linear NoGo with Combinatorial Game Theory. - Haoyu Du; Martin Müller 003 (CG, 2024)

Analysing KataGo: A Comparative Evaluation Against Perfect Play in the Game of Go. - Asmaul Husna; Martin Müller 003 (CG, 2024)

Learning With Generalised Card Representations for "Magic: The Gathering". - Timo Bertram; Johannes Fürnkranz; Martin Müller 003 (CoG, 2024)

Expected Work Search: Combining Win Rate and Proof Size Estimation. - Owen Randall; Martin Müller 003; Ting-Han Wei; Ryan Hayward (IJCAI, 2024)

Efficiently Training Neural Networks for Imperfect Information Games by Sampling Information Sets. - Timo Bertram; Johannes Fürnkranz; Martin Müller 003 (KI, 2024)

Exploiting the Replay Memory Before Exploring the Environment: Enhancing Reinforcement Learning Through Empirical MDP Iteration. - Hongming Zhang 003; Chenjun Xiao; Chao Gao; Han Wang; Bo Xu 002; Martin Müller 003 (NeurIPS, 2024)

Exploring Conflict Generating Decisions: Initial Results (Extended Abstract). - Md. Solimul Chowdhury; Martin Müller 003; Jia-Huai You (SOCS, 2024)

Contrastive Learning of Preferences with a Contextual InfoNCE Loss. - Timo Bertram; Johannes Fürnkranz; Martin Müller 003 (CoRR, 2024)

A Distance-based Anomaly Detection Framework for Deep Reinforcement Learning. - Hongming Zhang 003; Ke Sun 013; Bo Xu 002; Linglong Kong; Martin Müller 003 (Trans. Mach. Learn. Res., 2024)

Neural Network-Based Information Set Weighting for Playing Reconnaissance Blind Chess. - Timo Bertram; Johannes Fürnkranz; Martin Müller 003 (IEEE Trans. Games, 2024)

β-DQN: Improving Deep Q-Learning By Evolving the Behavior. - Hongming Zhang 003; Fengshuo Bai; Chenjun Xiao; Chao Gao; Bo Xu 002; Martin Müller 003 (AAMAS, 2025)

ETGL-DDPG: A Deep Deterministic Policy Gradient Algorithm for Sparse Reward Continuous Control. - Ehsan Futuhi; Shayan Karimi; Chao Gao; Martin Müller 003 (Trans. Mach. Learn. Res., 2025)