Score Bounded Monte-Carlo Tree Search

@inproceedings{Cazenave2010ScoreBM,
  title={Score Bounded Monte-Carlo Tree Search},
  author={T. Cazenave and Abdallah Saffidine},
  booktitle={Computers and Games},
  year={2010}
}
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It is for example the case in games that can end in draw positions. In this case it improves significantly a MCTS solver to take into account bounds on the possible scores of a node in order to select the nodes to explore. We apply our algorithm to solving Seki in the game of Go and to Connect Four. 
Monte Carlo Tree Search in Simultaneous Move Games with Applications to Goofspiel
TLDR
This paper discusses the adaptation of MCTS to simultaneous move games, and introduces a new algorithm, Online Outcome Sampling (OOS), that approaches a Nash equilibrium strategy over time. Expand
Monte Carlo Game Solver
TLDR
A general algorithm to order moves so as to speedup exact game solvers using online learning of playout policies and Monte Carlo Tree Search. Expand
Monte-Carlo Tree Search for the Simultaneous Move Game Tron
Monte-Carlo Tree Search (MCTS) has been successfully applied to many games, particularly in Go. In this paper, we investigate the performance of MCTS in Tron, which is a two-player simultaneous moveExpand
Nested Monte Carlo Search for Two-Player Games
TLDR
This work seeks to improve the quality of information extracted from the Monte Carlo playout in three ways: by nesting the evaluation function inside another evaluation function; by measuring and utilising the depth of the playout; and by incorporating pruning strategies that eliminate unnecessary searches and avoid traps. Expand
A Survey of Monte Carlo Tree Search Methods
TLDR
A survey of the literature to date of Monte Carlo tree search, intended to provide a snapshot of the state of the art after the first five years of MCTS research, outlines the core algorithm's derivation, impart some structure on the many variations and enhancements that have been proposed, and summarizes the results from the key game and nongame domains. Expand
Monte Carlo Tree Search with heuristic evaluations using implicit minimax backups
TLDR
This paper proposes a new way to use heuristic evaluations to guide the MCTS search by storing the two sources of information, estimated win rates and heuristic evaluated, separately, separately and shows that using implicit minimax backups leads to stronger play performance in Kalah, Breakthrough, and Lines of Action. Expand
Some Improvements for Monte-Carlo Tree Search, Game Description Language Compilati
TLDR
This thesis enhances MCTS with an algorithm to keep track of admissible bounds that allows to solve certain positions and improves the playing strength in general, and proposes a parametric adaptation of the Upper Confidence bound for Trees (UCT) algorithm to the Direct Acyclic Graph (DAG) case. Expand
Search Policies in Multi-Player Games
TLDR
This article investigates how three multi-player search policies, namely maxn, paranoid, and Best-Reply Search, can be embedded in the MCTS framework and introduces a multi- player variant of the M CTS-Solver. Expand
Game-Tree Search Using Proof Numbers: The First Twenty Years
TLDR
An overview of the research on Proof-Number Search and its many variants and enhancements is provided. Expand
Solving Games and All That
Efficient best-first search algorithms have been developed for deterministic two-player games with two-outcome.We present a formal framework to represent such best-first search algorithms.TheExpand
...
1
2
3
4
...

References

SHOWING 1-10 OF 31 REFERENCES
Nested Monte-Carlo Search
TLDR
Nested Monte-Carlo Search addresses the problem of guiding the search toward better states when there is no available heuristic, and uses nested levels of random games to guide the search. Expand
Single-Player Monte-Carlo Tree Search
TLDR
This paper proposes a new MCTS variant, called Single-Player Monte-Carlo Tree Search (SP-MCTS), which makes use of a straightforward Meta-Search extension and gained the highest score so far on the standardized test set. Expand
Monte-Carlo Tree Search Solver
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In this article we investigate the application of MCTS for the game Lines of Action (LOA). A new MCTSExpand
Evaluation Function Based Monte-Carlo LOA
TLDR
This paper investigates how to use a positional evaluation function in a Monte-Carlo simulation-based LOA program (MC-LOA), and finds that the Mixed strategy is the best among them. Expand
Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
  • Rémi Coulom
  • Mathematics, Computer Science
  • Computers and Games
  • 2006
TLDR
A new framework to combine tree search with Monte-Carlo evaluation, that does not separate between a min-max phase and a Monte- carlo phase is presented, that provides finegrained control of the tree growth, at the level of individual simulations, and allows efficient selectivity. Expand
Simulation-Based Approach to General Game Playing
TLDR
This paper introduces and empirically evaluates a new scheme for automatically learning search-control knowledge for guiding the simulation playouts, showing that it offers significant benefits for a variety of games. Expand
Computers and Games
TLDR
This paper is the first attempt to apply dependency-based search to Connect6 programs, and the targeted program is NCTU6, which won Connect6 tournaments in the Computer Olympiad twice and defeated many professional players in Man-Machine Connect6 championships. Expand
Bandit Based Monte-Carlo Planning
TLDR
A new algorithm is introduced, UCT, that applies bandit ideas to guide Monte-Carlo planning and is shown to be consistent and finite sample bounds are derived on the estimation error due to sampling. Expand
Amazons Discover Monte-Carlo
TLDR
This paper applies Monte-Carlo algorithms and their UCT-like successors to an Amazons-playing program to create a hybrid MC/UCT program that is superior to both the basic MC-UCT program and the conventional minimax-based programs. Expand
Achieving Master Level Play in 9 x 9 Computer Go
TLDR
Using both heuristic UCT and RAVE, MoGo became the first program to achieve human master level in competitive play and forms a rapid online generalisation based on the value of moves. Expand
...
1
2
3
4
...