ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Monte Carlo tree search in a distributed environment

Jure Grabnar (2015) Monte Carlo tree search in a distributed environment. EngD thesis.

Download (596Kb)


    Monte Carlo Tree Search algorithm (MCTS) is a computationally expensive algorithm. The time needed for computation correlates with the quality of the results. The purpose of this work is to parallelize MCTS method. With parallelization we gain an ability to increase the number of simulated games per turn and other parameters and still be able to receive results in sufficient time. Quality of results has been improved significantly. Parallel algorithm was written in MPI library which enables the program to run on multiple computers. Algorithm was evaluated on different problem sizes. With big enough problem, the speedup was approximately linear. Algorithm was run on a grid network which is administered by Slovenian Initiative for National Grid (SLING). As a part of this work, instructions for usage of grid network were created.

    Item Type: Thesis (EngD thesis)
    Keywords: Monte Carlo Tree Search, distributed systems, SLING, artificial intelligence, MPI
    Number of Pages: 35
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    prof. dr. Branko Šter283Mentor
    izr. prof. dr. Uroš Lotrič270Comentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536568771)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 3094
    Date Deposited: 14 Sep 2015 14:02
    Last Modified: 16 Oct 2015 09:50
    URI: http://eprints.fri.uni-lj.si/id/eprint/3094

    Actions (login required)

    View Item