Seeding for Success: Skill and Stochasticity in Tabletop Games

• URL: http://arxiv.org/abs/2503.02686v1
• Date: Tue, 04 Mar 2025 14:58:59 GMT
• Title: Seeding for Success: Skill and Stochasticity in Tabletop Games
• Authors: James Goodman, Diego Perez-Liebana, Simon Lucas,
• Abstract summary: Games often incorporate random elements in the form of dice or shuffled card decks.<n>This randomness is a key contributor to the player experience and the variety of game situations encountered.<n>There is a tension between a level of randomness that makes the game interesting and contributes to the player enjoyment of a game, and a level at which the outcome itself is effectively random and the game becomes dull.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Games often incorporate random elements in the form of dice or shuffled card decks. This randomness is a key contributor to the player experience and the variety of game situations encountered. There is a tension between a level of randomness that makes the game interesting and contributes to the player enjoyment of a game, and a level at which the outcome itself is effectively random and the game becomes dull. The optimal level for a game will depend on the design goals and target audience. We introduce a new technique to quantify the level of randomness in game outcome and use it to compare 15 tabletop games and disentangle the different contributions to the overall randomness from specific parts of some games. We further explore the interaction between game randomness and player skill, and how this innate randomness can affect error analysis in common game experiments.

Related papers

• Correcting Subverted Random Oracles [55.4766447972367]
  We prove that a simple construction can transform a "subverted" random oracle which disagrees with the original one at a small fraction of inputs into an object that is indifferentiable from a random function. Our results permit future designers of cryptographic primitives in typical kleptographic settings to use random oracles as a trusted black box.
  arXiv  Detail & Related papers  (2024-04-15T04:01:50Z)
• Evolutionary Tabletop Game Design: A Case Study in the Risk Game [0.1474723404975345]
  This work proposes an extension of the approach for tabletop games, evaluating the process by generating variants of Risk. We achieved this using a genetic algorithm to evolve the chosen parameters, as well as a rules-based agent to test the games. Results show the creation of new variations of the original game with smaller maps, resulting in shorter matches.
  arXiv  Detail & Related papers  (2023-10-30T20:53:26Z)
• Optimisation of MCTS Player for The Lord of the Rings: The Card Game [0.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"
  arXiv  Detail & Related papers  (2021-09-24T14:42:32Z)
• Conditions that enable a player to surely win in sequential quantum games [0.0]
  This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The main conclusion of this paper is that the specific rules of a game are absolutely critical.
  arXiv  Detail & Related papers  (2021-06-13T15:16:31Z)
• Generating Diverse and Competitive Play-Styles for Strategy Games [58.896302717975445]
  We propose Portfolio Monte Carlo Tree Search with Progressive Unpruning for playing a turn-based strategy game (Tribes) We show how it can be parameterized so a quality-diversity algorithm (MAP-Elites) is used to achieve different play-styles while keeping a competitive level of play. Our results show that this algorithm is capable of achieving these goals even for an extensive collection of game levels beyond those used for training.
  arXiv  Detail & Related papers  (2021-04-17T20:33:24Z)
• On the Power of Refined Skat Selection [1.3706331473063877]
  Skat is a fascinating card game, show-casing many of the intrinsic challenges for modern AI systems. We propose hard expert-rules and a scoring function based on refined skat evaluation features. Experiments emphasize the impact of the refined skat putting algorithm on the playing performance of the bots.
  arXiv  Detail & Related papers  (2021-04-07T08:54:58Z)
• Mixed Nash Equilibria in the Adversarial Examples Game [18.181826693937776]
  This paper tackles the problem of adversarial examples from a game theoretic point of view. We study the open question of the existence of mixed Nash equilibria in the zero-sum game formed by the attacker and the classifier.
  arXiv  Detail & Related papers  (2021-02-13T11:47:20Z)
• Faster Algorithms for Optimal Ex-Ante Coordinated Collusive Strategies in Extensive-Form Zero-Sum Games [123.76716667704625]
  We focus on the problem of finding an optimal strategy for a team of two players that faces an opponent in an imperfect-information zero-sum extensive-form game. In that setting, it is known that the best the team can do is sample a profile of potentially randomized strategies (one per player) from a joint (a.k.a. correlated) probability distribution at the beginning of the game. We provide an algorithm that computes such an optimal distribution by only using profiles where only one of the team members gets to randomize in each profile.
  arXiv  Detail & Related papers  (2020-09-21T17:51:57Z)
• TotalBotWar: A New Pseudo Real-time Multi-action Game Challenge and Competition for AI [62.997667081978825]
  TotalBotWar is a new pseudo real-time multi-action challenge for game AI. The game is based on the popular TotalWar games series where players manage an army to defeat the opponent's one.
  arXiv  Detail & Related papers  (2020-09-18T09:13:56Z)
• Learning to Play Sequential Games versus Unknown Opponents [93.8672371143881]
  We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We propose a novel algorithm for the learner when playing against an adversarial sequence of opponents. Our results include algorithm's regret guarantees that depend on the regularity of the opponent's response.
  arXiv  Detail & Related papers  (2020-07-10T09:33:05Z)
• Efficient exploration of zero-sum stochastic games [83.28949556413717]
  We investigate the increasingly important and common game-solving setting where we do not have an explicit description of the game but only oracle access to it through gameplay. During a limited-duration learning phase, the algorithm can control the actions of both players in order to try to learn the game and how to play it well. Our motivation is to quickly learn strategies that have low exploitability in situations where evaluating the payoffs of a queried strategy profile is costly.
  arXiv  Detail & Related papers  (2020-02-24T20:30:38Z)

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.