Monte Carlo tree search in the board game of Scotland Yard

Nejc Ilenič (2015) Monte Carlo tree search in the board game of Scotland Yard. EngD thesis.

Preview

Abstract

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.

Item Type:

Thesis (EngD thesis)

Keywords:

tree search, Monte Carlo, imperfect information, Scotland Yard, decision making, Upper Confidence Bound for trees, artificial intelligence

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
prof. dr. Branko Šter	283	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536566979 )

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

3096

Date Deposited:

14 Sep 2015 14:10

Last Modified:

15 Oct 2015 15:09

URI:

http://eprints.fri.uni-lj.si/id/eprint/3096

Actions (login required)

View Item