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 …

Abstract Monte Carlo Tree Search (MCTS) techniques brought fresh breeze to the area of
computer games where they significantly improved solving algorithms for games such as …

This thesis proposes, analyzes and tests different exploration-based techniques in Greedy
Best-First Search (GBFS) for satisficing planning. First, we show the potential of exploration …

The Monte Carlo Tree Search (MCTS) algorithm has recently proved to be able to solve
difficult problems in the field of optimization as well as game-playing. It has been able to …

In this document, we are interested in Artificial Intelligence (AI). AI is an important branch of
computer-science. We can find a lot of different definitions of AI. For instance, we can find …

In this thesis we study two optimization fields. In a first part, we study the use of evolutionary
algorithms for solving derivative-free optimization problems in continuous space. In a …