Original title: Aplikace MCTS na hru Quoridor
Translated title: Application of MCTS to the game Quoridor
Authors: Tomek, Jakub ; Hric, Jan (advisor) ; Majerech, Vladan (referee)
Document type: Bachelor's theses
Year: 2011
Language: cze
Abstract: [cze] [eng]
Monte Carlo Tree Search je relativně novou technikou prohledávání stromu navrženou pro počítačového hráče v hrách, které mají příliš velký stavový prostor na to, aby šel efektivně prohledávat deterministickým algoritmem. MCTS v základní verzi poskytuje jednoduchý způsob ohodnocování pozic bez jakýchkoliv doménově specificikých znalostí. MCTS byl již aplikován v mnoha variantách pro počítačové Go, jeho použití na ostatní hry však dosud není zdaleka tak hluboce prozkoumáno. Tato práce se zabývá možností použití MCTS na jednu konkrétní hru, a to Quridor. Monte Carlo Tree Search is quite a new technique for searching a tree developed for a computer player in games, that have too large state space to be effectively searched by an deterministic algorithm. MCTS in its basic version offers a simple way to evaluate positions without any domain specific knowledge. MCTS was already applied in many variants for computer Go, however its usage for other games has not been nearly as deep studied. This work deals with the option of using MCTS on a particular game called Quoridor.
Keywords: Monte Carlo Tree Search; Quoridor; UCT; Monte Carlo Tree Search; Quoridor; UCT

Institution: Charles University Faculties (theses) (web)
Document availability information: Available in the Charles University Digital Repository.
Original record: http://hdl.handle.net/20.500.11956/50262

Permalink: http://www.nusl.cz/ntk/nusl-314551


The record appears in these collections:
Universities and colleges > Public universities > Charles University > Charles University Faculties (theses)
Academic theses (ETDs) > Bachelor's theses