StarAI: Reducing incompleteness in the game of Bridge using PLP

• URL: http://arxiv.org/abs/2001.08193v1
• Date: Wed, 22 Jan 2020 18:27:51 GMT
• Title: StarAI: Reducing incompleteness in the game of Bridge using PLP
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bridge is a trick-taking card game requiring the ability to evaluate probabilities since it is a game of incomplete information 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.

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)
• 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)
• 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)
• Confidentiality in a Card-Based Protocol Under Repeated Biased Shuffles [2.256268727491054]
  We provide a probabilistic analysis of the confidentiality in a card-based protocol.<n>We focus on Bert den Boer's original Five Card Trick to develop our approach.
  arXiv  Detail & Related papers  (2025-11-07T09:50:56Z)
• People use fast, goal-directed simulation to reason about novel games [75.25089384921557]
  We study how people reason about a range of simple but novel connect-n style board games. 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)
• Learning With Generalised Card Representations for "Magic: The Gathering" [4.336779198334903]
  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.
  arXiv  Detail & Related papers  (2024-07-08T12:42:44Z)
• Closed Drafting as a Case Study for First-Principle Interpretability, Memory, and Generalizability in Deep Reinforcement Learning [3.018656336329545]
  We study the interpretability, generalizability, and memory of Deep Q-Network (DQN) models playing closed drafting games. We use a popular family of closed drafting games called "Sushi Go Party", in which we achieve state-of-the-art performance.
  arXiv  Detail & Related papers  (2023-10-31T17:24:40Z)
• Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games [70.19141208203227]
  We consider the problem of decentralized multi-agent reinforcement learning in Markov games. We show that no algorithm attains no-regret in general-sum games when executed independently by all players. We show that our lower bounds hold even for seemingly easier setting in which all agents are controlled by a centralized algorithm.
  arXiv  Detail & Related papers  (2023-03-22T03:28:12Z)
• Principal Trade-off Analysis [79.16635054977068]
  We show "Principal Trade-off Analysis" (PTA), a decomposition method that embeds games into a low-dimensional feature space. PTA represents an arbitrary two-player zero-sum game as the weighted sum of pairs of 2D feature planes. We demonstrate the validity of PTA on a quartet of games (Kuhn poker, RPS+2, Blotto, and Pokemon)
  arXiv  Detail & Related papers  (2022-06-09T18:16:28Z)
• 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)
• Knowledge-Based Paranoia Search in Trick-Taking [1.3706331473063877]
  This paper proposes emphknowledge-based paraonoia search (KBPS) to find forced wins during trick-taking in the card game Skat. It combines efficient partial information game-tree search with knowledge representation and reasoning.
  arXiv  Detail & Related papers  (2021-04-07T09:12:45Z)
• 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)
• 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)
• 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.