Instruct: Given a paper title, retrieve paper titles that are cited by the given paper.
Query: Asymptotic Properties of Minimax Trees and Game-Searching Procedures
Experiments With Some Programs That Search Game Trees
Solving Large Imperfect Information Games Using CFR+
The History Heuristic and Alpha-Beta Search Enhancements in Practice
Evolving neural networks to focus minimax search
An algorithm for constructing and solving imperfect recall abstractions of large extensive-form games
Searching optimal movements in multi-player games with imperfect information
A Minimax Algorithm Better than Alpha-Beta ?
Monte-Carlo Tree Search: A New Framework for Game AI
A Survey of Monte Carlo Tree Search Methods
Investigating the Limits of Monte-Carlo Tree Search Methods in Computer Go
Parallel Game-Tree Search
MTD(f), A Minimax Algorithm Faster Than NegaScout
Determinization and information set Monte Carlo Tree Search for the card game Dou Di Zhu
an algorithmic game theory primer .
Game-tree search over high-level game states in RTS games
The grand challenge of computer Go: Monte Carlo tree search and extensions
Efficient Nash Equilibrium Approximation through Monte Carlo Counterfactual Regret Minimization
AlphaGo and Monte Carlo tree search: The simulation optimization perspective
Monte-Carlo Tree Search for the Game of 7 Wonders
Bandit Algorithms for Tree Search
Machine Learning Techniques for Cooperative Spectrum Sensing in Cognitive Radio Networks
miniAdapton: A Minimal Implementation of Incremental Computation in Scheme
Testing Cache Side-Channel Leakage
Enabling packet fan-out in the libpcap library for parallel traffic processing
Chess-playing programs and the problem of complexity