Martin Müller

ORCID

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 42

Top Venues

Publications

Timo Bertram, Johannes Fürnkranz, Martin Müller
Neural Network-based Information Set Weighting for Playing Reconnaissance Blind Chess. CoRR (2024)
Timo Bertram, Johannes Fürnkranz, Martin Müller
Contrastive Learning of Preferences with a Contextual InfoNCE Loss. CoRR (2024)
Timo Bertram, Johannes Fürnkranz, Martin Müller
Learning With Generalised Card Representations for "Magic: The Gathering". CoRR (2024)
Owen Randall, Martin Müller, Ting-Han Wei, Ryan Hayward
Expected Work Search: Combining Win Rate and Proof Size Estimation. CoRR (2024)
Farnaz Kohankhaki, Kiarash Aghakasiri, Hongming Zhang, Ting-Han Wei, Chao Gao, Martin Müller
Monte Carlo Tree Search in the Presence of Transition Uncertainty. AAAI (2024)
Md. Solimul Chowdhury, Martin Müller, Jia-Huai You
Exploring Conflict Generating Decisions: Initial Results (Extended Abstract). SOCS (2024)
Timo Bertram, Johannes Fürnkranz, Martin Müller
Efficiently Training Neural Networks for Imperfect Information Games by Sampling Information Sets. CoRR (2024)
Jiuqi Wang, Martin Müller, Jonathan Schaeffer
Deep Dive on Checkers Endgame Data. CoG (2023)
Farnaz Kohankhaki, Kiarash Aghakasiri, Hongming Zhang, Ting-Han Wei, Chao Gao, Martin Müller
Monte Carlo Tree Search in the Presence of Transition Uncertainty. CoRR (2023)
Haoyu Du, Ting-Han Wei, Martin Müller
Solving NoGo on Small Rectangular Boards. ACG (2023)
Hongming Zhang, Chenjun Xiao, Han Wang, Jun Jin, Bo Xu, Martin Müller
Replay Memory as An Empirical MDP: Combining Conservative Estimation with Experience Replay. ICLR (2023)
Quazi Asif Sadmine, Asmaul Husna, Martin Müller
Stockfish or Leela Chess Zero? A Comparison Against Endgame Tablebases. ACG (2023)
Timo Bertram, Johannes Fürnkranz, Martin Müller
Weighting Information Sets with Siamese Neural Networks in Reconnaissance Blind Chess. CoG (2023)
Timo Bertram, Johannes Fürnkranz, Martin Müller
Supervised and Reinforcement Learning from Observations in Reconnaissance Blind Chess. CoG (2022)
Timo Bertram, Johannes Fürnkranz, Martin Müller
Quantity vs Quality: Investigating the Trade-Off between Sample Size and Label Reliability. CoRR (2022)
Owen Randall, Ting-Han Wei, Ryan Hayward, Martin Müller
Improving Search in Go Using Bounded Static Safety. CG (2022)
Timo Bertram, Johannes Fürnkranz, Martin Müller
Supervised and Reinforcement Learning from Observations in Reconnaissance Blind Chess. CoRR (2022)
Rejwana Haque, Ting-Han Wei, Martin Müller
On the Road to Perfection? Evaluating Leela Chess Zero Against Endgame Tablebases. ACG (2021)
Ryan W. Gardner, Gino Perrotta, Anvay Shah, Shivaram Kalyanakrishnan, Kevin A. Wang, Gregory Clark, Timo Bertram, Johannes Fürnkranz, Martin Müller, Brady P. Garrison, Prithviraj Dasgupta, Saeid Rezaei
The Machine Reconnaissance Blind Chess Tournament of NeurIPS 2022. NeurIPS (Competition and Demos) (2021)
Md. Solimul Chowdhury, Martin Müller, Jia-Huai You
A Deep Dive into Conflict Generating Decisions. CoRR (2021)
Md. Solimul Chowdhury, Martin Müller, Jia-Huai You
Guiding CDCL SAT Search via Random Exploration amid Conflict Depression. AAAI (2020)
Jincheng Mei, Chenjun Xiao, Ruitong Huang, Dale Schuurmans, Martin Müller
On Principled Entropy Exploration in Policy Optimization. IJCAI (2019)
Chenjun Xiao, Yifan Wu, Chen Ma, Dale Schuurmans, Martin Müller
Learning to Combat Compounding-Error in Model-Based Reinforcement Learning. CoRR (2019)
Md. Solimul Chowdhury, Martin Müller, Jia-Huai You
Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics. CP (2019)
Md. Solimul Chowdhury, Martin Müller, Jia-Huai You
Characterization of Glue Variables in CDCL SAT Solving. CoRR (2019)
Chenjun Xiao, Ruitong Huang, Jincheng Mei, Dale Schuurmans, Martin Müller
Maximum Entropy Monte-Carlo Planning. NeurIPS (2019)
Chao Gao, Siqi Yan, Ryan Hayward, Martin Müller
A transferable neural network for Hex. J. Int. Comput. Games Assoc. 40 (3) (2018)
Chenjun Xiao, Jincheng Mei, Martin Müller
Memory-Augmented Monte Carlo Tree Search. AAAI (2018)
Chao Gao, Martin Müller, Ryan Hayward
Adversarial Policy Gradient for Alternating Markov Games. ICLR (Workshop) (2018)
Chao Gao, Martin Müller, Ryan Hayward
Three-Head Neural Network Architecture for Monte Carlo Tree Search. IJCAI (2018)
Chao Gao, Ryan Hayward, Martin Müller
Move Prediction Using Deep Convolutional Neural Networks in Hex. IEEE Trans. Games 10 (4) (2018)
Md. Solimul Chowdhury, Martin Müller, Jia-Huai You
Preliminary Results on Exploration-Driven Satisfiability Solving. AAAI (2018)
I-Chen Wu, Chang-Shing Lee, Yuandong Tian, Martin Müller
Guest Editorial Special Issue on Deep/Reinforcement Learning and Games. IEEE Trans. Games 10 (4) (2018)
Gaojian Fan, Robert Holte, Martin Müller
MS-Lite: A Lightweight, Complementary Merge-and-Shrink Method. ICAPS (2018)
Farhad Haqiqat, Martin Müller
Analyzing the Impact of Knowledge and Search in Monte Carlo Tree Search in Go. CGW@IJCAI (2018)
Ruitong Huang, Mohammad M. Ajallooeian, Csaba Szepesvári, Martin Müller
Structured Best Arm Identification with Fixed Confidence. ALT (2017)
Gaojian Fan, Martin Müller, Robert Holte
The Two-Edged Nature of Diverse Action Costs. ICAPS (2017)
Chao Gao, Martin Müller, Ryan Hayward
Focused Depth-first Proof Number Search using Convolutional Neural Networks for the Game of Hex. IJCAI (2017)
Gaojian Fan, Martin Müller, Robert Holte
Additive Merge-and-Shrink Heuristics for Diverse Action Costs. IJCAI (2017)
Ruitong Huang, Mohammad M. Ajallooeian, Csaba Szepesvári, Martin Müller
Structured Best Arm Identification with Fixed Confidence. CoRR (2017)
Chenjun Xiao, Martin Müller
Factorization Ranking Model for Move Prediction in the Game of Go. AAAI (2016)
Chenjun Xiao, Martin Müller
Integrating Factorization Ranked Features in MCTS: An Experimental Study. CGW@IJCAI (2016)
Martin Müller
Keynote speech III: Computer go research - The challenges ahead. CIG (2015)
Yeqin Zhang, Martin Müller
TDS+: Improving Temperature Discovery Search. AAAI (2015)
Fan Xie, Martin Müller, Robert Holte
Understanding and Improving Local Exploration for GBFS. ICAPS (2015)
Jiaxing Song, Martin Müller
An Enhanced Solver for the Game of Amazons. IEEE Trans. Comput. Intell. AI Games 7 (1) (2015)
Hootan Nakhost, Martin Müller
Towards a theory of random walk planning: Regress factors, fair homogeneous graphs and extensions. AI Commun. 27 (4) (2014)
Gaojian Fan, Martin Müller, Robert Holte
Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions. SOCS (2014)
Fan Xie, Martin Müller, Robert Holte
Adding Local Exploration to Greedy Best-First Search in Satisficing Planning. AAAI (2014)
Fan Xie, Martin Müller, Robert Holte, Tatsuya Imai
Type-Based Exploration with Multiple Search Queues for Satisficing Planning. AAAI (2014)
Shih-Chieh Huang, Broderick Arneson, Ryan B. Hayward, Martin Müller, Jakub Pawlewicz
MoHex 2.0: A Pattern-Based MCTS Hex Player. Computers and Games (2013)
David Silver, Richard S. Sutton, Martin Müller
Temporal-Difference Search in Computer Go. ICAPS (2013)
Shih-Chieh Huang, Martin Müller
Investigating the Limits of Monte-Carlo Tree Search Methods in Computer Go. Computers and Games (2013)
Hootan Nakhost, Martin Müller
Towards a Second Generation Random Walk Planner: An Experimental Exploration. IJCAI (2013)
Fan Xie, Richard Anthony Valenzano, Martin Müller
Better Time Constrained Search via Randomization and Postprocessing. ICAPS (2013)
Sumudu Fernando, Martin Müller
Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go. Computers and Games (2013)
David Silver, Richard S. Sutton, Martin Müller
Temporal-difference search in computer Go. Mach. Learn. 87 (2) (2012)
Hootan Nakhost, Jörg Hoffmann, Martin Müller
Resource-Constrained Planning: A Monte Carlo Random Walk Approach. ICAPS (2012)
Hootan Nakhost, Martin Müller
A Theoretical Framework for Studying Random Walk Planning. SOCS (2012)
Akihiro Kishimoto, Mark H. M. Winands, Martin Müller, Jahn-Takeshi Saito
Game-Tree Search Using Proof Numbers: The First Twenty Years. J. Int. Comput. Games Assoc. 35 (3) (2012)
James Styles, Holger H. Hoos, Martin Müller
Automatically Configuring Algorithms for Scaling Performance. LION (2012)
Fan Xie, Hootan Nakhost, Martin Müller
Planning Via Random Walk-Driven Local Search. ICAPS (2012)
Richard Anthony Valenzano, Hootan Nakhost, Martin Müller, Jonathan Schaeffer, Nathan R. Sturtevant
ArvandHerd: Parallel Planning with a Portfolio. ECAI (2012)
Henry Brausen, Ryan B. Hayward, Martin Müller, Abdul Qadir, David Spies
Blunder Cost in Go and Hex. ACG (2011)
Fan Xie, Hootan Nakhost, Martin Müller
A Local Monte Carlo Tree Search Approach in Deterministic Planning. AAAI (2011)
Gabriel Van Eyck, Martin Müller
Revisiting Move Groups in Monte-Carlo Tree Search. ACG (2011)
Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer
Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators CoRR (2011)
Chang-Shing Lee, Martin Müller, Olivier Teytaud
Special Issue on Monte Carlo Techniques and Computer Go. IEEE Trans. Comput. Intell. AI Games 2 (4) (2010)
David Tom, Martin Müller
Computational Experiments with the RAVE Heuristic. Computers and Games (2010)
Hootan Nakhost, Jörg Hoffmann, Martin Müller
Improving Local Search for Resource-Constrained Planning. SOCS (2010)
Neil Burch, Robert C. Holte, Martin Müller, David O'Connell, Jonathan Schaeffer
Automating Layouts of Sewers in Subdivisions. ECAI (2010)
Markus Enzenberger, Martin Müller, Broderick Arneson, R. Segal
Fuego - An Open-Source Framework for Board Games and Go Engine Based on Monte Carlo Tree Search. IEEE Trans. Comput. Intell. AI Games 2 (4) (2010)
Hootan Nakhost, Martin Müller
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement. ICAPS (2010)
Markus Enzenberger, Martin Müller
A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm. ACG (2009)
Hootan Nakhost, Martin Müller
Monte-Carlo Exploration for Deterministic Planning. IJCAI (2009)
David Tom, Martin Müller
A Study of UCT and Its Enhancements in an Artificial Game. ACG (2009)
David Silver, Richard S. Sutton, Martin Müller
Sample-based learning and search with permanent and transient memories. ICML (2008)
Akihiro Kishimoto, Martin Müller
About the Completeness of Depth-First Proof-Number Search. Computers and Games (2008)
Xiaozhen Niu, Martin Müller
An Improved Safety Solver in Go Using Partial Regions. Computers and Games (2008)
Ling Zhao, Martin Müller
Using Artificial Boundaries in the Game of Go. Computers and Games (2008)
Adi Botea, Martin Müller, Jonathan Schaeffer
Fast Planning with Iterative Macros. IJCAI (2007)
Kazuki Yoshizoe, Akihiro Kishimoto, Martin Müller
Lambda Depth-First Proof Number Search and Its Application to Go. IJCAI (2007)
David Silver, Richard S. Sutton, Martin Müller
Reinforcement Learning of Local Shape in the Game of Go. IJCAI (2007)
Xiaozhen Niu, Akihiro Kishimoto, Martin Müller
Recognizing Seki in Computer Go. ACG (2006)
Xiaozhen Niu, Martin Müller
An Open Boundary Safety-of-Territory Solver for the Game of Go. Computers and Games (2006)
Ling Zhao, Martin Müller
Solving Probabilistic Combinatorial Games. ACG (2006)
Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, Steve Sutphen
Solving Checkers. IJCAI (2005)
Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer
Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. J. Artif. Intell. Res. 24 (2005)
Akihiro Kishimoto, Martin Müller
Search versus Knowledge for Solving Life and Death Problems in Go. AAAI (2005)
Adi Botea, Martin Müller, Jonathan Schaeffer
Learning Partial-Order Macros from Solutions. ICAPS (2005)
Akihiro Kishimoto, Martin Müller
A solution to the GHI problem for depth-first proof-number search. Inf. Sci. 175 (4) (2005)
Akihiro Kishimoto, Martin Müller
Dynamic Decomposition Search: A Divide and Conquer Approach and its Application to the One-Eye Problem in Go. CIG (2005)
Ling Zhao, Martin Müller
Game-SAT: A Preliminary Report. SAT (2004)
Xiaozhen Niu, Martin Müller
An Improved Safety Solver for Computer Go. Computers and Games (2004)
Adi Botea, Martin Müller, Jonathan Schaeffer
Near Optimal Hierarchical Path-Finding. J. Game Dev. 1 (1) (2004)
Akihiro Kishimoto, Martin Müller
A General Solution to the Graph History Interaction Problem. AAAI (2004)
Martin Müller, Markus Enzenberger, Jonathan Schaeffer
Temperature Discovery Search. AAAI (2004)
Martin Müller, Zhichao Li
Locally Informed Global Search for Sums of Combinatorial Games. Computers and Games (2004)
Jianjun Zhou, Martin Müller
Solving Systems of Difference Constraints Incrementally with Bidirectional Search. Algorithmica 39 (3) (2004)
Adi Botea, Martin Müller, Jonathan Schaeffer
Using Component Abstraction for Automatic Generation of Macro-Actions. ICAPS (2004)

Martin Müller.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martin Müller