Because of its success in the computer game of Go, Monte Carlo Tree Search is becoming a progressively popular decision making algorithm in various domains. It has proven its strengths in singleplayer and multiplayer games with perfect information, however domain specific improvements must be introduced in games with imperfect information.
In thesis existing approaches to the problem of applying the tree search to the Scotland Yard board game are described and empiricaly tested. It has turned out that heuristic selection of the possible location of the hider has the most impact on seekers performance. After testing, the MCTS player with all improvements has proven itself as a competitive opponent against the human player.
|
