Saved in:
Bibliographic Details
Main Author: Jehn, Rüdiger
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.01002
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918363824914432
author Jehn, Rüdiger
author_facet Jehn, Rüdiger
contents In the paper it is proven that the two-players turn-based stochastic game "Risk or Safety" has a unique solution. Both players need to play the same strategy if they want to maximize their winning chances. An analytical method based on the transition equations depending on the players decisions at each game situation is presented. However, the method requires the solution of many large linear equation systems, which makes the problem practically unsolvable for more than 6 coins. Hence, an iterative method is used to determine the optimal strategy for up to 20 coins. A look-up table gives the number of coins a player should toss at each possible game situation.
format Preprint
id arxiv_https___arxiv_org_abs_2603_01002
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Optimal strategy in the game Risk or Safety
Jehn, Rüdiger
Combinatorics
Computer Science and Game Theory
60G50
In the paper it is proven that the two-players turn-based stochastic game "Risk or Safety" has a unique solution. Both players need to play the same strategy if they want to maximize their winning chances. An analytical method based on the transition equations depending on the players decisions at each game situation is presented. However, the method requires the solution of many large linear equation systems, which makes the problem practically unsolvable for more than 6 coins. Hence, an iterative method is used to determine the optimal strategy for up to 20 coins. A look-up table gives the number of coins a player should toss at each possible game situation.
title Optimal strategy in the game Risk or Safety
topic Combinatorics
Computer Science and Game Theory
60G50
url https://arxiv.org/abs/2603.01002