MCTS Based Agents for Multistage Single-Player Card Game

09/24/2021
by   Konrad Godlewski, et al.
0

The article presents the use of Monte Carlo Tree Search algorithms for the card game Lord of the Rings. The main challenge was the complexity of the game mechanics, in which each round consists of 5 decision stages and 2 random stages. To test various decision-making algorithms, a game simulator has been implemented. The research covered an agent based on expert rules, using flat Monte-Carlo search, as well as complete MCTS-UCB. Moreover different playout strategies has been compared. As a result of experiments, an optimal (assuming a limited time) combination of algorithms were formulated. The developed MCTS based method have demonstrated a advantage over agent with expert knowledge.

READ FULL TEXT

page 3

page 4

research
09/24/2021

Optimisation of MCTS Player for The Lord of the Rings: The Card Game

The article presents research on the use of Monte-Carlo Tree Search (MCT...
research
07/28/2021

Monte Carlo Tree Search for high precision manufacturing

Monte Carlo Tree Search (MCTS) has shown its strength for a lot of deter...
research
05/11/2021

Designing an Automatic Agent for Repeated Language based Persuasion Games

Persuasion games are fundamental in economics and AI research and serve ...
research
10/30/2020

Interleaving Fast and Slow Decision Making

The "Thinking, Fast and Slow" paradigm of Kahneman proposes that we use ...
research
02/19/2018

Automated Playtesting with Procedural Personas through MCTS with Evolved Heuristics

This paper describes a method for generative player modeling and its app...
research
12/07/2022

Generating Real-Time Strategy Game Units Using Search-Based Procedural Content Generation and Monte Carlo Tree Search

Real-Time Strategy (RTS) game unit generation is an unexplored area of P...

Please sign up or login with your details

Forgot password? Click here to reset