Towards a Characterisation of Monte-Carlo Tree Search Performance in Different Games

• URL: http://arxiv.org/abs/2406.09242v1
• Date: Thu, 13 Jun 2024 15:46:27 GMT
• Title: Towards a Characterisation of Monte-Carlo Tree Search Performance in Different Games
• Authors: Dennis J. N. J. Soemers, Guillaume Bams, Max Persoon, Marco Rietjens, Dimitar Sladić, Stefan Stefanov, Kurt Driessens, Mark H. M. Winands,
• Abstract summary: This paper describes work on an initial dataset that we have built to make progress towards such an understanding. We describe a preliminary analysis and work on training predictive models on this dataset, as well as lessons learned and future plans for a new and improved version of the dataset.
• Score: 1.1567513466696948
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many enhancements to Monte-Carlo Tree Search (MCTS) have been proposed over almost two decades of general game playing and other artificial intelligence research. However, our ability to characterise and understand which variants work well or poorly in which games is still lacking. This paper describes work on an initial dataset that we have built to make progress towards such an understanding: 268,386 plays among 61 different agents across 1494 distinct games. We describe a preliminary analysis and work on training predictive models on this dataset, as well as lessons learned and future plans for a new and improved version of the dataset.

Related papers

• Improve Value Estimation of Q Function and Reshape Reward with Monte Carlo Tree Search [0.4450107621124637]
  Reinforcement learning has achieved remarkable success in perfect information games such as Go and Atari. Research in reinforcement learning for imperfect information games has been relatively limited due to the more complex game structures and randomness. In this paper, we focus on Uno, an imperfect information game, and aim to address these problems by reducing Q value overestimation and reshaping reward function.
  arXiv  Detail & Related papers  (2024-10-15T14:31:54Z)
• Enhancements for Real-Time Monte-Carlo Tree Search in General Video Game Playing [1.2882480196517305]
  This paper discusses eight enhancements for Monte-Carlo Tree Search (MCTS) in General Video Game Playing (GVGP) Some of these are known from existing literature, and are either extended or introduced in the context of GVGP. Most enhancements are shown to provide statistically significant increases in win percentages when applied individually.
  arXiv  Detail & Related papers  (2024-07-03T12:18:28Z)
• Machine Learning for Soccer Match Result Prediction [0.9002260638342727]
  This chapter discusses available datasets, the types of models and features, and ways of evaluating model performance. The aim of this chapter is to give a broad overview of the current state and potential future developments in machine learning for soccer match results prediction.
  arXiv  Detail & Related papers  (2024-03-12T14:00:50Z)
• Difficulty Modelling in Mobile Puzzle Games: An Empirical Study on Different Methods to Combine Player Analytics and Simulated Data [0.0]
  A common practice consists of creating metrics out of data collected by player interactions with the content. This allows for estimation only after the content is released and does not consider the characteristics of potential future players. In this article, we present a number of potential solutions for the estimation of difficulty under such conditions.
  arXiv  Detail & Related papers  (2024-01-30T20:51:42Z)
• JECC: Commonsense Reasoning Tasks Derived from Interactive Fictions [75.42526766746515]
  We propose a new commonsense reasoning dataset based on human's Interactive Fiction (IF) gameplay walkthroughs. Our dataset focuses on the assessment of functional commonsense knowledge rules rather than factual knowledge. Experiments show that the introduced dataset is challenging to previous machine reading models as well as the new large language models.
  arXiv  Detail & Related papers  (2022-10-18T19:20:53Z)
• WinoGAViL: Gamified Association Benchmark to Challenge Vision-and-Language Models [91.92346150646007]
  In this work, we introduce WinoGAViL: an online game to collect vision-and-language associations. We use the game to collect 3.5K instances, finding that they are intuitive for humans but challenging for state-of-the-art AI models. Our analysis as well as the feedback we collect from players indicate that the collected associations require diverse reasoning skills.
  arXiv  Detail & Related papers  (2022-07-25T23:57:44Z)
• Multi-Game Decision Transformers [49.257185338595434]
  We show that a single transformer-based model can play a suite of up to 46 Atari games simultaneously at close-to-human performance. We compare several approaches in this multi-game setting, such as online and offline RL methods and behavioral cloning. We find that our Multi-Game Decision Transformer models offer the best scalability and performance.
  arXiv  Detail & Related papers  (2022-05-30T16:55:38Z)
• Teach me to play, gamer! Imitative learning in computer games via linguistic description of complex phenomena and decision tree [55.41644538483948]
  We present a new machine learning model by imitation based on the linguistic description of complex phenomena. The method can be a good alternative to design and implement the behaviour of intelligent agents in video game development.
  arXiv  Detail & Related papers  (2021-01-06T21:14:10Z)
• Learning to Play Imperfect-Information Games by Imitating an Oracle Planner [77.67437357688316]
  We consider learning to play multiplayer imperfect-information games with simultaneous moves and large state-action spaces. Our approach is based on model-based planning. We show that the planner is able to discover efficient playing strategies in the games of Clash Royale and Pommerman.
  arXiv  Detail & Related papers  (2020-12-22T17:29:57Z)
• Navigating the Landscape of Multiplayer Games [20.483315340460127]
  We show how network measures applied to response graphs of large-scale games enable the creation of a landscape of games. We illustrate our findings in domains ranging from canonical games to complex empirical games capturing the performance of trained agents pitted against one another.
  arXiv  Detail & Related papers  (2020-05-04T16:58:17Z)
• Learning Dynamic Belief Graphs to Generalize on Text-Based Games [55.59741414135887]
  Playing text-based games requires skills in processing natural language and sequential decision making. In this work, we investigate how an agent can plan and generalize in text-based games using graph-structured representations learned end-to-end from raw text.
  arXiv  Detail & Related papers  (2020-02-21T04:38:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.