As technologies evolve and computer systems shrink to the size of matchboxes, also their field of application shifts in new directions. Our permanent companions, mobile phones, p...
Christian Bertelsmeyer, Erik Koch, Alexander H. Sc...
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit...
Abstract. Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers stati...
Pervasive games provide a new type of game combining new technologies with the real environment of the players. While this already poses new challenges to the game developer, requ...
Wolfgang Broll, Jan Ohlenburg, Irma Lindt, Iris He...
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...