Learning With Generalised Card Representations for "Magic: The Gathering"

• URL: http://arxiv.org/abs/2407.05879v1
• Date: Mon, 8 Jul 2024 12:42:44 GMT
• Title: Learning With Generalised Card Representations for "Magic: The Gathering"
• Abstract summary: This work explores possible card representations that generalise to unseen cards. We study such representations based on numerical, nominal, and text-based features of cards, card images, and meta information about card usage from third-party services. Our results show that while the particular choice of generalised input representation has little effect on learning to predict human card selections among known cards, the performance on new, unseen cards can be greatly improved.
• Score: 4.336779198334903
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A defining feature of collectable card games is the deck building process prior to actual gameplay, in which players form their decks according to some restrictions. Learning to build decks is difficult for players and models alike due to the large card variety and highly complex semantics, as well as requiring meaningful card and deck representations when aiming to utilise AI. In addition, regular releases of new card sets lead to unforeseeable fluctuations in the available card pool, thus affecting possible deck configurations and requiring continuous updates. Previous Game AI approaches to building decks have often been limited to fixed sets of possible cards, which greatly limits their utility in practice. In this work, we explore possible card representations that generalise to unseen cards, thus greatly extending the real-world utility of AI-based deck building for the game "Magic: The Gathering".We study such representations based on numerical, nominal, and text-based features of cards, card images, and meta information about card usage from third-party services. Our results show that while the particular choice of generalised input representation has little effect on learning to predict human card selections among known cards, the performance on new, unseen cards can be greatly improved. Our generalised model is able to predict 55\% of human choices on completely unseen cards, thus showing a deep understanding of card quality and strategy.

Related papers

• Predicting Drafted Deck Strength for "Magic: the Gathering" [16.700051324124143]
  Magic: the Gathering (MTG) exemplifies this setting, where the cards themselves define and alter gameplay rules, strategic constraints, and long-term outcomes.<n>We study Draft, a constrained deck-building format of MTG in which eight players make 39-45 sequential selections from semi-random packs to construct a 40-card deck under partial information.<n>We propose an encoder-based model that produces set-contextualized card embeddings to encode the draft decision sequence, with a consistent improvement over linear baselines on large-scale real-world data.
  arXiv  Detail & Related papers  (2026-07-06T08:12:35Z)
• Domain-Independent Game Abstraction using Word Embedding Techniques [62.94836578759359]
  We propose a domain-independent approach to game abstraction.<n>Treating each action as a word and gameplay data as a corpus, word vectors can be trained to represent each action as a real-valued vector.
  arXiv  Detail & Related papers  (2026-05-15T02:30:36Z)
• Valet: A Standardized Testbed of Traditional Imperfect-Information Card Games [0.6417777780911224]
  Valet is a diverse and comprehensive testbed of 21 traditional imperfect-information card games.<n>These games span multiple genres, cultures, player counts, deck structures, mechanics, winning conditions, and methods of hiding and revealing information.<n>We empirically characterize each game's branching factor and duration using random simulations to demonstrate the suitability of Valet as a benchmarking suite.
  arXiv  Detail & Related papers  (2026-03-03T18:46:47Z)
• Outer-Learning Framework for Playing Multi-Player Trick-Taking Card Games: A Case Study in Skat [1.7006003864727406]
  In multi-player card games such as Skat or Bridge, the early stages of the game are often more critical to the success of the play than refined middle- and end-game play.<n>In this paper, we derive and evaluate a general bootstrapping outer-learning framework that improves prediction accuracy by expanding the database of human games with millions of self-playing AI games to generate and merge statistics.<n>We implement perfect feature hash functions to address compacted tables, producing a self-improving card game engine, where newly inferred knowledge is continuously improved during self-learning.
  arXiv  Detail & Related papers  (2025-12-17T13:27:44Z)
• Instruction-Driven Game Engine: A Poker Case Study [53.689520884467065]
  The IDGE project aims to democratize game development by enabling a large language model to follow free-form game descriptions and generate game-play processes. We train the IDGE in a curriculum manner that progressively increases its exposure to complex scenarios. Our initial progress lies in developing an IDGE for Poker, which not only supports a wide range of poker variants but also allows for highly individualized new poker games through natural language inputs.
  arXiv  Detail & Related papers  (2024-10-17T11:16:27Z)
• 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)
• SNAP: Self-Supervised Neural Maps for Visual Positioning and Semantic Understanding [57.108301842535894]
  We introduce SNAP, a deep network that learns rich neural 2D maps from ground-level and overhead images. We train our model to align neural maps estimated from different inputs, supervised only with camera poses over tens of millions of StreetView images. SNAP can resolve the location of challenging image queries beyond the reach of traditional methods.
  arXiv  Detail & Related papers  (2023-06-08T17:54:47Z)
• 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)
• 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)
• Predicting Human Card Selection in Magic: The Gathering with Contextual Preference Ranking [0.0]
  We study drafting in the context of the card game Magic: The Gathering. We propose the use of a contextual preference network, which learns to compare two possible extensions of a given deck of cards. We demonstrate that the resulting network is better able to evaluate card decks in this game than previous attempts.
  arXiv  Detail & Related papers  (2021-05-25T12:07:27Z)
• Evolving Evaluation Functions for Collectible Card Game AI [1.370633147306388]
  We presented a study regarding two important aspects of evolving feature-based game evaluation functions. The choice of genome representation and the choice of opponent used to test the model were studied. We encoded our experiments in a programming game, Legends of Code and Magic, used in Strategy Card Game AI Competition.
  arXiv  Detail & Related papers  (2021-05-03T18:39:06Z)
• 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)
• 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)
• StarAI: Reducing incompleteness in the game of Bridge using PLP [0.0]
  Bridge is a trick-taking card game where each player only sees its cards. In order to choose a strategy, a player needs to gather information about the hidden cards in the other players' hand. We present a methodology allowing us to model a part of card playing in Bridge using Probabilistic Logic Programming.
  arXiv  Detail & Related papers  (2020-01-22T18:27:51Z)
• Evolutionary Approach to Collectible Card Game Arena Deckbuilding using Active Genes [1.027974860479791]
  In the arena game mode, before each match, a player has to construct his deck choosing cards one by one from the previously unknown options. We propose a variant of the evolutionary algorithm that uses a concept of an active gene to reduce the range of the operators only to generation-specific subsequences of the genotype.
  arXiv  Detail & Related papers  (2020-01-05T22:46:08Z)

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.