Monte Carlo tree search (MCTS) is a recently proposed search method that combines the
precision of tree search with the generality of random sampling. It has received considerable …

Fuelled by successes in Computer Go, Monte Carlo tree search (MCTS) has achieved wide-
spread adoption within the games community. Its links to traditional reinforcement learning …

The dominant paradigm for programs playing the game of Go is Monte Carlo tree search.
This algorithm builds a search tree by playing many simulated games (playouts). Each …

The aim of general game playing (GGP) is to create programs capable of playing a wide
range of different games at an expert level, given only the rules of the game. The most …

Even though a scientific explanation may appear to be a mode { of rational order, we should
not inferfrom that order that the genesis of the explanation was itself orderly. Science is only …

Monte Carlo tree search (MCTS) is being effectively used in many domains, but acquiring
good results from building larger trees takes time that can in many cases be impractical. In …

In this paper, we are interested in the minimization of the travel cost of the traveling
salesman problem with time windows. In order to do this minimization we use a Nested …

The rapid development of Cloud Computing and Content Delivery Networks (CDNs) brings
a significant increase in data transfers that leads to new optimization challenges in inter-data …

This paper describes how Monte Carlo tree search (MCTS) can be applied to the hide-and-
seek game Scotland Yard. This game is essentially a two-player game in which the players …

Abstract Monte Carlo Tree Search (MCTS) has produced many breakthroughs in search-
based decision-making in games and other domains. There exist many general-purpose …