Reflexive Monte-Carlo Search
نویسنده
چکیده
Reflexive Monte-Carlo search uses the Monte-Carlo search of a given level to improve the search of the upper level. We describe the application to Morpion Solitaire. For the non touching version, reflexive Monte-Carlo search breaks the current record and establishes a new record of 78 moves.
منابع مشابه
A Monte Carlo-Based Search Strategy for Dimensionality Reduction in Performance Tuning Parameters
Redundant and irrelevant features in high dimensional data increase the complexity in underlying mathematical models. It is necessary to conduct pre-processing steps that search for the most relevant features in order to reduce the dimensionality of the data. This study made use of a meta-heuristic search approach which uses lightweight random simulations to balance between the exploitation of ...
متن کاملMonte-Carlo Hex
We present YOPT a program that plays Hex using Monte-Carlo tree search. We describe heuristics that improve simulations and tree search. We also address the combination of Monte-Carlo tree search with virtual connection search.
متن کاملProbabilistic Power Distribution Planning Using Multi-Objective Harmony Search Algorithm
In this paper, power distribution planning (PDP) considering distributed generators (DGs) is investigated as a dynamic multi-objective optimization problem. Moreover, Monte Carlo simulation (MCS) is applied to handle the uncertainty in electricity price and load demand. In the proposed model, investment and operation costs, losses and purchased power from the main grid are incorporated in the f...
متن کاملMonte-Carlo Approximation of Temperature
Monte-Carlo tree search is a powerful paradigm for the game of Go. We propose to use Monte-Carlo tree search to approximate the temperature of a game, using the mean result of the playouts. Experimental results on the sum of five 7x7 Go games show that it improves much on a global search algorithm.
متن کاملA New Method for Parallel Monte Carlo Tree Search
In recent years there has been much interest in the Monte Carlo tree search algorithm, a new, adaptive, randomized optimization algorithm. In fields as diverse as Artificial Intelligence, Operations Research, and High Energy Physics, research has established that Monte Carlo tree search can find good solutions without domain dependent heuristics. However, practice shows that reaching high perfo...
متن کامل