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

Search in incomplete information games: a case of tressete

Žan Kafol (2014) Search in incomplete information games: a case of tressete. MSc thesis.

Download (2225Kb)


    We explore different approaches for solving problems with incomplete information. As an example a card game Tressette is chosen where the incomplete information is presented as cards still in the deck. This means that players cannot make deterministic strategies on possible outcomes or predict the moves of an opponent, because such moves are not guaranteed, but are possible with certain probability. The main emphasis is on the Monte Carlo tree search method (MCTS), which uses random sampling and simulates only a part of the search space. MCTS has proven to be a successful method in this domain. A prototype of an intelligent agent was developed for playing the game. The agent was gradually improved by tuning MCTS method parameters and by introducing new heuristics into the search. We used knowledge extracted from the database of human-played games in the agent to improve its efficiency. The agent was tested by different approaches playing against each other and against human players.

    Item Type: Thesis (MSc thesis)
    Keywords: Monte Carlo Tree Search, Incomplete information, Artificial Intelligence, Tressette, Expectiminimax, search algorithm, Tressette, game playing
    Number of Pages: 40
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    izr. prof. dr. Marko Robnik Šikonja276Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536017603)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 2819
    Date Deposited: 30 Sep 2014 09:12
    Last Modified: 06 Nov 2014 11:38
    URI: http://eprints.fri.uni-lj.si/id/eprint/2819

    Actions (login required)

    View Item