Simulating Virtual Players for UNO without Computers

• URL: http://arxiv.org/abs/2502.05987v1
• Date: Sun, 09 Feb 2025 18:37:31 GMT
• Title: Simulating Virtual Players for UNO without Computers
• Abstract summary: We propose a protocol that can simulate virtual players using only physical cards.<n>Our protocol can uniformly select a valid card to play from each virtual player's hand at random.<n>The protocol can also be applied to simulate virtual players in other turn-based card or tile games.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: UNO is a popular multiplayer card game. In each turn, a player has to play a card in their hand having the same number or color as the most recently played card. When having few people, adding virtual players to play the game can easily be done in UNO video games. However, this is a challenging task for physical UNO without computers. In this paper, we propose a protocol that can simulate virtual players using only physical cards. In particular, our protocol can uniformly select a valid card to play from each virtual player's hand at random, or report that none exists, without revealing the rest of its hand. The protocol can also be applied to simulate virtual players in other turn-based card or tile games where each player has to select a valid card or tile to play in each turn.

Related papers

• Card-Based Computation in the Virtual Player Simulation Model [0.0]
  We study generic card-based computation in the virtual player simulation model.<n>We present the Play-Minimum protocol, which securely selects and plays the minimum-value card from a virtual player's hand.<n>We also present the Sorting protocol, which securely arranges a virtual player's hand in nondecreasing order.
  arXiv  Detail & Related papers  (2026-09-02T15:24:28Z)
• A Moderatorless Protocol for WEREWOLF [0.8156494881838946]
  Social deduction games, or hidden-role games, are multiplayer games in which players are assigned private roles.<n>We show that Werewolf can be played without a moderator or any digital device, using only ordinary playing cards.
  arXiv  Detail & Related papers  (2026-05-29T16:10:46Z)
• Playing Dice with the Universe: Programming Quantum Computers to Play Traditional Games [0.0]
  We show how to program a quantum computer to play tic-tac-toe against a human opponent.<n>We anticipate that, as it has for classical computers, game-playing will serve as an important real-world benchmark for quantum computers.
  arXiv  Detail & Related papers  (2026-04-26T17:41:17Z)
• People use fast, flat goal-directed simulation to reason about novel problems [68.55490343866545]
  We show that people are systematic and adaptively rational in how they play a game for the first time.<n>We explain these capacities via a computational cognitive model that we call the "Intuitive Gamer"<n>Our work offers new insights into how people rapidly evaluate, act, and make suggestions when encountering novel problems.
  arXiv  Detail & Related papers  (2025-10-13T15:12:08Z)
• People use fast, goal-directed simulation to reason about novel games [71.0171482296852]
  We study how people reason about a range of simple but novel Connect-N style board games.<n>We ask people to judge how fair and how fun the games are from very little experience.
  arXiv  Detail & Related papers  (2024-07-19T07:59:04Z)
• 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)
• Entangling capabilities and unitary quantum games [1.8416014644193066]
  We consider a class of games between two competing players that take turns acting on the same many-body quantum register. This class of zero-sum games has a clear second mover advantage if both players can entangle the same portion of the register. We show, however, that if the first player can entangle a larger number of qubits than the second player (which we refer to as having quantum advantage), then the second mover advantage can be significantly reduced.
  arXiv  Detail & Related papers  (2023-08-18T16:49:34Z)
• 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)
• 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)
• 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)
• Automatic Player Identification in Dota 2 [0.0]
  We present a machine learning approach to identify players in Dota 2. We use data on mouse movements, in-game statistics and game strategy extracted from match replays. We are able to obtain an accuracy of prediction of 95% for the problem of predicting if two different matches were played by the same player.
  arXiv  Detail & Related papers  (2020-08-27T22:58:01Z)
• Suphx: Mastering Mahjong with Deep Reinforcement Learning [114.68233321904623]
  We design an AI for Mahjong, named Suphx, based on deep reinforcement learning with some newly introduced techniques. Suphx has demonstrated stronger performance than most top human players in terms of stable rank. This is the first time that a computer program outperforms most top human players in Mahjong.
  arXiv  Detail & Related papers  (2020-03-30T16:18:16Z)
• 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.