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 …

In n-player sequential move games, the second root-player move appears at tree depth n+
1. Depending on n and time, tree search techniques can struggle to expand the game tree …

Monte-Carlo Tree Search (MCTS) has been found to show weaker play than minimax-based
search in some tactical game domains. This is partly due to its highly selective search and …

Autonomous agents need to make decisions in a sequential manner, under partially
observable environment, and in consideration of how other agents behave. In critical …

While computing resources have continued to grow, methods for building and using large
heuristics have not seen significant advances in recent years. We have observed that …

This thesis investigates how selective-search methods can improve the performance of a
game program for a given domain. Selective-search methods aim to explore only the …

Abstract Best-Reply Search (BRS) is a new search technique for game-tree search in multi-
player games. In BRS, the exponentially many possibilities that can be considered by …

In this article, we compare four different “game spaces” in terms of their usefulness in
characterizing multiplayer tabletop games, with a particular interest in any underlying …

Recent research on external-memory search has shown that disks can be effectively used
as secondary storage when performing large breadthfirst searches. We introduce the Write …

Product Propagation (pp) is an algorithm to backup probabilistic evaluations for abstract two-
player games. It was shown that pp could solve Go problems as efficiently as Proof Number …