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

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

The article presents research on the use of Monte-Carlo Tree Search (MCTS) methods to create an artificial player for the popular card game "The Lord of the Rings". The game is characterized by complicated rules, multi-stage round construction, and a high level of randomness. The described study found that the best probability of a win is received for a strategy combining expert knowledge-based agents with MCTS agents at different decision stages. It is also beneficial to replace random playouts with playouts using expert knowledge. The results of the final experiments indicate that the relative effectiveness of the developed solution grows as the difficulty of the game increases.

READ FULL TEXT

page 2

page 5

research
09/24/2021

MCTS Based Agents for Multistage Single-Player Card Game

The article presents the use of Monte Carlo Tree Search algorithms for t...
research
02/19/2015

The (Final) countdown

The Countdown game is one of the oldest TV show running in the world. It...
research
02/07/2019

Agent-Based Adaptive Level Generation for Dynamic Difficulty Adjustment in Angry Birds

This paper presents an adaptive level generation algorithm for the physi...
research
04/27/2018

Development of Rehabilitation System (ReHabgame) through Monte-Carlo Tree Search Algorithm

Computational Intelligence (CI) in computer games plays an important rol...
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
08/04/2019

Monte-Carlo Tree Search for Simulation-based Strategy Analysis

Games are often designed to shape player behavior in a desired way; howe...

Please sign up or login with your details

Forgot password? Click here to reset