|
|
Mariáš Card Game Trainer
Malý, Dominik ; Senft, Martin (advisor) ; Bílý, Tomáš (referee)
Mariáš is probably the most well-known and favourite card game in Czech Republic and despite this remains to be seen almost exclusively in our country. In this work we study the ways, how can this interesting game be implemented in the speech of ones and zeros typical for computers. This work also briefly describes the evolution of full information games solving algorithms, from old minimax to alfabeta pruning and my own adjusted negamax - algorithm for games without full information, using a more universal approach, which could be theorethically extended for all card games, whether existing or not.
|
|
|
Solving of Problems using MCTS
Malý, Dominik ; Hric, Jan (advisor) ; Majerech, Vladan (referee)
Title: Solving problems using MCTS Author: Dominik Malý Department: Department of theoretical informatics and mathematical logic Supervisor: RNDr. Jan Hric Supervisor's e-mail address: Jan.Hric@mff.cuni.cz Abstract: MCTS (Monte Carlo Tree Search) methods are a state-of-the-art approach to the computer solution of strategic board game Go. Because of their versatility and successfulness, these techniques show great potential for all kinds of problems. This paper aims to explore the suitability of MCTS for solving different kind of problems, specifically games of one player, like Sudoku or SameGame. I've created a computer player based on MCTS, who can solve not only Sudoku and SameGame, but also other tasks of similar kind. I've experimentally examined many MCTS extensions and their eligibility for solving these games and through extensive testing I've also compared the suitability of various kinds of UCT selection fun- ctions and used heuristics. In case of SameGame I've compared my algorithm to another exi- sting one undertaking the same problem. In the end I've described what kind of problems has a MCTS-based computer player to overcome, if it is to successfully solve games of this type, and what characteristics should these problems posses to be suitable for MCTS solution. Keywords: MCTS, Go, Sudoku,...
|
|
|
Solving of Problems using MCTS
Malý, Dominik ; Hric, Jan (advisor) ; Majerech, Vladan (referee)
Title: Solving problems using MCTS Author: Dominik Malý Department: Department of theoretical informatics and mathematical logic Supervisor: RNDr. Jan Hric Supervisor's e-mail address: Jan.Hric@mff.cuni.cz Abstract: MCTS (Monte Carlo Tree Search) methods are a state-of-the-art approach to the computer solution of strategic board game Go. Because of their versatility and successfulness, these techniques show great potential for all kinds of problems. This paper aims to explore the suitability of MCTS for solving different kind of problems, specifically games of one player, like Sudoku or SameGame. I've created a computer player based on MCTS, who can solve not only Sudoku and SameGame, but also other tasks of similar kind. I've experimentally examined many MCTS extensions and their eligibility for solving these games and through extensive testing I've also compared the suitability of various kinds of UCT selection fun- ctions and used heuristics. In case of SameGame I've compared my algorithm to another exi- sting one undertaking the same problem. In the end I've described what kind of problems has a MCTS-based computer player to overcome, if it is to successfully solve games of this type, and what characteristics should these problems posses to be suitable for MCTS solution. Keywords: MCTS, Go, Sudoku,...
|
|
|
Mariáš Card Game Trainer
Malý, Dominik ; Bílý, Tomáš (referee) ; Senft, Martin (advisor)
Mariáš is probably the most well-known and favourite card game in Czech Republic and despite this remains to be seen almost exclusively in our country. In this work we study the ways, how can this interesting game be implemented in the speech of ones and zeros typical for computers. This work also briefly describes the evolution of full information games solving algorithms, from old minimax to alfabeta pruning and my own adjusted negamax - algorithm for games without full information, using a more universal approach, which could be theorethically extended for all card games, whether existing or not.
|
guest ::
RSS feed.