A finite exact algorithm to solve a dice game

DOI10.1017/JPR.2015.11zbMATH Open1346.90800OpenAlexW2294492610MaRDI QIDQ2804415FDOQ2804415

Authors Fabián Crocce, Ernesto Mordecki

Publication date 29 April 2016

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.7488

zbMATH Keywords

optimal controldice gameMarkov control processfinite exact algorithm

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Markov and semi-Markov decision processes (90C40)

Abstract: We provide an algorithm to find the value and an optimal strategy of the solitaire variant of the Ten Thousand dice game in the framework of Markov Control Processes. Once an optimal critical threshold is found, the set of non-stopping states of the game becomes finite, and the solution is found by a backwards algorithm that gives the values for each one of these states of the game. The algorithm is finite and exact.The idea to find the critical threshold comes from the continuous pasting condition used in optimal stopping problems for continuous-time processes with jumps.

Recommendations

• Optimal Stopping in a Dice Game
• Developing an optimal strategy for a maximization dice game
• An analysis of TENZI using combinatorics and Markov chains
• A REAL-WORLD STOCHASTIC TWO-PERSON GAME
• A non-iterative algorithm for generalized pig games

Cites work

• scientific article; zbMATH DE number 3718885 (Why is no real title available?)
• scientific article; zbMATH DE number 46727 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1134975 (Why is no real title available?)
• scientific article; zbMATH DE number 3301983 (Why is no real title available?)
• A REAL-WORLD STOCHASTIC TWO-PERSON GAME
• Markov control process with the expected total cost criterion: Optimality, stability, and transient models
• Optimal Stopping in a Dice Game
• Optimal stopping for a diffusion with jumps
• Optimal strategy in a dice game

Cited in

(9)

• A REAL-WORLD STOCHASTIC TWO-PERSON GAME
• scientific article; zbMATH DE number 5038479 (Why is no real title available?)
• Optimal strategy in a dice game
• Let's get rolling! Exact optimal solitaire Yahtzee
• A non-iterative algorithm for generalized pig games
• A Markovian process modeling for Pickomino
• Developing an optimal strategy for a maximization dice game
• An analysis of TENZI using combinatorics and Markov chains
• Triangular numbers and the \(N\)-sided die optimal stopping problem

This page was built for publication: A finite exact algorithm to solve a dice game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804415)