Zpět na vyhledávání

Bc. Samuel Gazda

Bachelor's thesis

A Game-Playing Algorithm for Briscola

A Game-Playing Algorithm for Briscola
Abstract:
Táto práca využíva algoritmus Monte Carlo tree search (MCTS) ako hrací algoritmus pre taliansku kartovú hru Briscola. Prvá časť tejto práce poskytuje prehľad algoritmu MCTS, pravidiel hry Briscola a úspešných algoritmov na hranie kartových hier, konkrétne pokeru. Druhá časť sa venuje implementácii samotnej kartovej hry, modelov hry, algoritmov s využitím MCTS a pravidlových hracích algoritmov použitých …more
Abstract:
This thesis explores the Monte Carlo tree search's (MCTS) possible usage as a game-playing algorithm for the Italian card game Briscola. The work provides a brief introduction to the MCTS algorithm, rules of Briscola, the tools used, examples of successful usage of MCTS in other games and our approach to this problem. Explanation of our solution includes implementation of the game itself, models of …more
 

Keywords

AI artificial intelligence game AI Briscola
 
Language used: English
Date on which the thesis was submitted / produced: 25. 5. 2021
Identifier: https://is.muni.cz/th/rfvzn/

Thesis defence

  • Date of defence: 2. 7. 2021
  • Supervisor: RNDr. Petr Novotný, Ph.D.
  • Reader: Mgr. Matej Gallo

Citation record

Cite this text

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky
Složka Reference to the local database directory of the institution

Masaryk University

Faculty of Informatics

Bachelor programme / field:
Informatics / Artificial Intelligence and Natural Language Processing

Theses on a related topic

List of theses with an identical keyword.