Chess on Ice: Curling Tactical Decision-Making via Backward Induction and Deep Reinforcement Learning

• URL: http://arxiv.org/abs/2608.02379v1
• Date: Mon, 03 Aug 2026 15:23:42 GMT
• Title: Chess on Ice: Curling Tactical Decision-Making via Backward Induction and Deep Reinforcement Learning
• Abstract summary: We propose a reinforcement learning framework capable of quantitatively evaluating and comparing options in curling.<n>We employ the Deep Deterministic Policy Gradient actor-critic algorithm to exploit the finite-horizon structure of the game.<n>Our experiments show that effective curling strategies can be acquired in a fully self-supervised manner, without any human-annotated data.
• Score: 10.932188857276605
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Curling is often referred to as "Chess on Ice", owing to the tactical complexity of its decision-making process. Yet unlike chess, curling remains largely underexplored from a machine learning perspective, with prior work confined mainly to statistical approaches. We propose a reinforcement learning framework capable of quantitatively evaluating and comparing tactical options in curling. The game poses several modeling challenges: continuous state and action spaces, stochastic action outcomes reflecting player skill variability, and state transitions that are highly sensitive to small perturbations in the executed action. To address them, we employ the Deep Deterministic Policy Gradient actor-critic algorithm, adapted to exploit the finite-horizon structure of the game. Our experiments show that effective curling strategies can be acquired in a fully self-supervised manner, without any human-annotated data: on a reduced four-rock variant, the learned agent matches a hand-crafted expert heuristic in a regime where that heuristic is close to optimal, a parity we quantify against the intrinsic hammer advantage of the variant. Beyond the resulting policy, the learned critic provides a dense value estimate over the entire continuous action space, enabling the quantitative comparison of tactical alternatives for applications such as post-game performance analysis and decision support during athlete preparation.

Related papers

• GenTac: Generative Modeling and Forecasting of Soccer Tactics [66.35532694378146]
  GenTac conceptualizes soccer tactics as a process over continuous multi-player trajectories and discrete semantic events.<n>It supports rich contextual conditioning, including opponent behavior, specific team or league playing styles, and strategic objectives.<n>It can be successfully trained to generalize to other dynamic team sports, including basketball, American football, and ice hockey.
  arXiv  Detail & Related papers  (2026-04-13T17:53:49Z)
• Oracle-Guided Soft Shielding for Safe Move Prediction in Chess [2.731293010500297]
  Existing reinforcement learning approaches for environments such as chess require hundreds of thousands of episodes and substantial computational resources to converge.<n>We propose Oracle-Guided Soft Shielding (OGSS), a simple yet effective framework for safer decision-making.<n>Our results demonstrate that OGSS variants maintain a lower blunder rate even as the agent's exploration ratio is increased.
  arXiv  Detail & Related papers  (2026-03-09T15:40:01Z)
• 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)
• Expandable Decision-Making States for Multi-Agent Deep Reinforcement Learning in Soccer Tactical Analysis [6.8055385768376615]
  Invasion team sports such as soccer produce a high-dimensional, strongly coupled state space as many players interact on a shared field.<n>Traditional rule-based analyses are intuitive, while modern predictive machine learning models often perform pattern-matching without explicit agent representations.<n>Here, we propose Expandable Decision-Making States (EDMS), a semantically enriched state representation that augments raw positions and velocities with relational variables.
  arXiv  Detail & Related papers  (2025-10-01T04:01:51Z)
• Aspect-based Sentiment Evaluation of Chess Moves (ASSESS): an NLP-based Method for Evaluating Chess Strategies from Textbooks [3.652509571098292]
  This study investigates the feasibility of using a modified sentiment analysis method as a means for evaluating chess moves based on text. By extracting insights from move-action phrases, our approach aims to provide a more fine-grained and contextually aware chess move'-based sentiment classification.
  arXiv  Detail & Related papers  (2024-05-10T14:23:43Z)
• A Minimaximalist Approach to Reinforcement Learning from Human Feedback [49.45285664482369]
  We present Self-Play Preference Optimization (SPO), an algorithm for reinforcement learning from human feedback. Our approach is minimalist in that it does not require training a reward model nor unstable adversarial training. We demonstrate that on a suite of continuous control tasks, we are able to learn significantly more efficiently than reward-model based approaches.
  arXiv  Detail & Related papers  (2024-01-08T17:55:02Z)
• 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 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 Use of heuristics for accelerating XCS-based Policy Learning in Markov Games [9.038065438586065]
  In games, playing against non-stationary opponents with learning ability is still challenging for reinforcement learning agents. This paper proposes efficient use of rough papers to speed up policy learning when playing against concurrent learners.
  arXiv  Detail & Related papers  (2020-05-26T07:47:27Z)
• 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.