General Board Game Concepts

• URL: http://arxiv.org/abs/2107.01078v1
• Date: Fri, 2 Jul 2021 13:39:10 GMT
• Title: General Board Game Concepts
• Authors: \'Eric Piette, Matthew Stephenson, Dennis J.N.J. Soemers and Cameron Browne
• Abstract summary: We propose to formalise the notion of "game concept", inspired by terms generally used by game players and designers. We describe concepts for several levels of abstraction, such as the game itself, the moves played, or the states reached. The creation of a hyper-agent selector, the transfer of AI learning between games, or explaining AI techniques using game terms can all be facilitated by the use of game concepts.
• Score: 8.344476599818828
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many games often share common ideas or aspects between them, such as their rules, controls, or playing area. However, in the context of General Game Playing (GGP) for board games, this area remains under-explored. We propose to formalise the notion of "game concept", inspired by terms generally used by game players and designers. Through the Ludii General Game System, we describe concepts for several levels of abstraction, such as the game itself, the moves played, or the states reached. This new GGP feature associated with the ludeme representation of games opens many new lines of research. The creation of a hyper-agent selector, the transfer of AI learning between games, or explaining AI techniques using game terms, can all be facilitated by the use of game concepts. Other applications which can benefit from game concepts are also discussed, such as the generation of plausible reconstructed rules for incomplete ancient games, or the implementation of a board game recommender system.

Related papers

• GAVEL: Generating Games Via Evolution and Language Models [40.896938709468465]
  We explore the generation of novel games in the Ludii game description language. We train a model that intelligently mutates and recombines games and mechanics expressed as code. A sample of the generated games are available to play online through the Ludii portal.
  arXiv  Detail & Related papers  (2024-07-12T16:08:44Z)
• Instruction-Driven Game Engines on Large Language Models [59.280666591243154]
  The IDGE project aims to democratize game development by enabling a large language model to follow free-form game rules. We train the IDGE in a curriculum manner that progressively increases the model's exposure to complex scenarios. Our initial progress lies in developing an IDGE for Poker, a universally cherished card game.
  arXiv  Detail & Related papers  (2024-03-30T08:02:16Z)
• Serious Games in Digital Gaming: A Comprehensive Review of Applications, Game Engines and Advancements [55.2480439325792]
  In recent years, serious games have become increasingly popular due to their ability to simultaneously educate and entertain users. In this review, we provide a comprehensive overview of the different types of digital games and expand on the serious games genre. We present the most widely used game engines used in the game development industry and extend the Unity game machine advantages.
  arXiv  Detail & Related papers  (2023-11-03T09:17:09Z)
• Promptable Game Models: Text-Guided Game Simulation via Masked Diffusion Models [68.85478477006178]
  We present a Promptable Game Model (PGM) for neural video game simulators. It allows a user to play the game by prompting it with high- and low-level action sequences. Most captivatingly, our PGM unlocks the director's mode, where the game is played by specifying goals for the agents in the form of a prompt. Our method significantly outperforms existing neural video game simulators in terms of rendering quality and unlocks applications beyond the capabilities of the current state of the art.
  arXiv  Detail & Related papers  (2023-03-23T17:43:17Z)
• The Ludii Game Description Language is Universal [2.643652100761611]
  We show that the language used by the Ludii general game system is capable of representing equivalent games for any arbitrary, finite, deterministic, fully observable extensive-form game. In this paper, we prove its universality by extending this to include finite non-deterministic and imperfect-information games.
  arXiv  Detail & Related papers  (2022-05-01T11:52:40Z)
• Public Information Representation for Adversarial Team Games [31.29335755664997]
  adversarial team games reside in the asymmetric information available to the team members during the play. Our algorithms convert a sequential team game with adversaries to a classical two-player zero-sum game. Due to the NP-hard nature of the problem, the resulting Public Team game may be exponentially larger than the original one.
  arXiv  Detail & Related papers  (2022-01-25T15:07:12Z)
• Spatial State-Action Features for General Games [5.849736173068868]
  We formulate a design and efficient implementation of spatial state-action features for general games. These are patterns that can be trained to incentivise or disincentivise actions based on whether or not they match variables of the state in a local area. We propose an efficient approach for evaluating active features for any given set of features.
  arXiv  Detail & Related papers  (2022-01-17T13:34:04Z)
• Deep Learning for General Game Playing with Ludii and Polygames [8.752301343910775]
  Combinations of Monte-Carlo tree search and Deep Neural Networks, trained through self-play, have produced state-of-the-art results for automated game-playing in many board games. This paper describes the implementation of a bridge between Ludii and Polygames, which enables Polygames to train and evaluate models for games that are implemented and run through Ludii.
  arXiv  Detail & Related papers  (2021-01-23T19:08:33Z)
• 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)
• Exploration Based Language Learning for Text-Based Games [72.30525050367216]
  This work presents an exploration and imitation-learning-based agent capable of state-of-the-art performance in playing text-based computer games. Text-based computer games describe their world to the player through natural language and expect the player to interact with the game using text. These games are of interest as they can be seen as a testbed for language understanding, problem-solving, and language generation by artificial agents.
  arXiv  Detail & Related papers  (2020-01-24T03:03:51Z)
• Smooth markets: A basic mechanism for organizing gradient-based learners [47.34060971879986]
  We introduce smooth markets (SM-games), a class of n-player games with pairwise zero sum interactions. SM-games codify a common design pattern in machine learning that includes (some) GANs, adversarial training, and other recent algorithms. We show that SM-games are amenable to analysis and optimization using first-order methods.
  arXiv  Detail & Related papers  (2020-01-14T09:19:39Z)

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.