Variations on the Reinforcement Learning performance of Blackjack

• URL: http://arxiv.org/abs/2308.07329v1
• Date: Wed, 9 Aug 2023 13:38:00 GMT
• Title: Variations on the Reinforcement Learning performance of Blackjack
• Abstract summary: The objective of the game is to win by obtaining a hand total higher than the dealer's without exceeding 21. The environment and inherent reward structure of blackjack presents an appealing problem to better understand reinforcement learning agents in the presence of environment variations. A blackjack simulator allowing for universal blackjack rules is also implemented to demonstrate the extent to which a card counter perfectly using the basic strategy and hi-lo system can bring the house to bankruptcy.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Blackjack or "21" is a popular card-based game of chance and skill. The objective of the game is to win by obtaining a hand total higher than the dealer's without exceeding 21. The ideal blackjack strategy will maximize financial return in the long run while avoiding gambler's ruin. The stochastic environment and inherent reward structure of blackjack presents an appealing problem to better understand reinforcement learning agents in the presence of environment variations. Here we consider a q-learning solution for optimal play and investigate the rate of learning convergence of the algorithm as a function of deck size. A blackjack simulator allowing for universal blackjack rules is also implemented to demonstrate the extent to which a card counter perfectly using the basic strategy and hi-lo system can bring the house to bankruptcy and how environment variations impact this outcome. The novelty of our work is to place this conceptual understanding of the impact of deck size in the context of learning agent convergence.

Related papers

• How Far Are LLMs from Professional Poker Players? Revisiting Game-Theoretic Reasoning with Agentic Tool Use [52.394999779049606]
  Large Language Models (LLMs) are increasingly applied in high-stakes domains.<n>LLMs fail to compete against traditional algorithms.<n>We propose ToolPoker, a tool-integrated reasoning framework.
  arXiv  Detail & Related papers  (2026-01-31T05:45:25Z)
• 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)
• Beyond Game Theory Optimal: Profit-Maximizing Poker Agents for No-Limit Holdem [0.06610877051761614]
  Game-Theory- Regret Minimization (CFR) performs best in heads-up situations and CFR remains the strongest method in most multi-way situations.<n>Our approach aims to show how poker agents can move from merely not losing to consistently winning against diverse opponents.
  arXiv  Detail & Related papers  (2025-09-28T08:51:57Z)
• Deceptive Sequential Decision-Making via Regularized Policy Optimization [54.38738815697299]
  Two regularization strategies for policy synthesis problems that actively deceive an adversary about a system's underlying rewards are presented. We show how each form of deception can be implemented in policy optimization problems. We show that diversionary deception can cause the adversary to believe that the most important agent is the least important, while attaining a total accumulated reward that is $98.83%$ of its optimal, non-deceptive value.
  arXiv  Detail & Related papers  (2025-01-30T23:41:40Z)
• Optimal Blackjack Strategy Recommender: A Comprehensive Study on Computer Vision Integration for Enhanced Gameplay [0.0]
  The project investigates the application of computer vision techniques for playing card detection and recognition in the context of blackjack. The proposed methodology involves using K-Means for image segmentation, card reprojection and feature extraction. The study aims to observe the effectiveness of this approach in detecting various card designs under different lighting conditions.
  arXiv  Detail & Related papers  (2024-03-29T23:17:49Z)
• Mastering Strategy Card Game (Legends of Code and Magic) via End-to-End Policy and Optimistic Smooth Fictitious Play [11.480308614644041]
  We study a two-stage strategy card game Legends of Code and Magic. We propose an end-to-end policy to address the difficulties that arise in multi-stage game. Our approach wins double championships of COG2022 competition.
  arXiv  Detail & Related papers  (2023-03-07T17:55:28Z)
• Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks [83.28949556413717]
  We study the problem of computing an approximate Nash equilibrium of continuous-action game without access to gradients. We model players' strategies using artificial neural networks. This paper is the first to solve general continuous-action games with unrestricted mixed strategies and without any gradient information.
  arXiv  Detail & Related papers  (2022-11-29T05:16:41Z)
• Learning Correlated Equilibria in Mean-Field Games [62.14589406821103]
  We develop the concepts of Mean-Field correlated and coarse-correlated equilibria. We show that they can be efficiently learnt in emphall games, without requiring any additional assumption on the structure of the game.
  arXiv  Detail & Related papers  (2022-08-22T08:31:46Z)
• No-Regret Learning in Time-Varying Zero-Sum Games [99.86860277006318]
  Learning from repeated play in a fixed zero-sum game is a classic problem in game theory and online learning. We develop a single parameter-free algorithm that simultaneously enjoys favorable guarantees under three performance measures. Our algorithm is based on a two-layer structure with a meta-algorithm learning over a group of black-box base-learners satisfying a certain property.
  arXiv  Detail & Related papers  (2022-01-30T06:10:04Z)
• 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)
• Disturbing Reinforcement Learning Agents with Corrupted Rewards [62.997667081978825]
  We analyze the effects of different attack strategies based on reward perturbations on reinforcement learning algorithms. We show that smoothly crafting adversarial rewards are able to mislead the learner, and that using low exploration probability values, the policy learned is more robust to corrupt rewards.
  arXiv  Detail & Related papers  (2021-02-12T15:53:48Z)
• DeepGamble: Towards unlocking real-time player intelligence using multi-layer instance segmentation and attribute detection [0.8749675983608171]
  For a casino, an unskilled player could fetch 4 times more revenue than a skilled player. This paper describes a video recognition system that is based on an extension of the Mask R-CNN model. Our system digitizes the game of blackjack by detecting cards and player bets in real-time.
  arXiv  Detail & Related papers  (2020-12-14T23:46:26Z)
• 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)
• Optimal strategies in the Fighting Fantasy gaming system: influencing stochastic dynamics by gambling with limited resource [0.0]
  Fighting Fantasy is a popular recreational fantasy gaming system worldwide. Each round, a limited resource (luck') may be spent on a gamble to amplify the benefit from a win or mitigate the deficit from a loss. We use a backward induction approach to solve the Bellman equation for the system and identify the optimal strategy for any given state during the game.
  arXiv  Detail & Related papers  (2020-02-24T11:31:25Z)

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.