Mitja Lapajne (2011) A program for playing Tarok using Monte-Carlo tree search. EngD thesis.
Monte-Carlo tree search is a relatively new algorithm showing promising results for general game playing. This work presents an implementation and results of the Monte-Carlo tree search algorithm applied to the card game Tarok. We applied the Monte-Carlo tree search algorithm to the game of Tarok as well as to a modified version of Tarok with perfect information and conducted several experiments with different parameters. We investigated how different values of parameter C, number of simulations per move and added heuristic knowledge impact the playing strength of the algorithm. The results suggest that the Monte-Carlo tree search algorithm is a viable option for computer Tarok game playing and shows the playing strength of an occasional player as well as offers many potential opportunities for further improvement.
Actions (login required)