An analysis of TENZI using combinatorics and Markov chains

DOI10.1080/0025570X.2021.1916295MaRDI QIDQ5019891zbMATH OpenOpenAlexFDO

Authors Michael H. Veatch

Publication date 11 January 2022

Published in Mathematics Magazine (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0025570x.2021.1916295

Mathematics Subject Classification ID

Combinatorial probability (60C05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probabilistic games; gambling (91A60)

Recommendations

• How to Win at Tenzi
• A finite exact algorithm to solve a dice game
• Nearly optimal computer play in multi-player Yahtzee
• Chutes and Ladders for the Impatient
• A Markovian process modeling for Pickomino

Cites work

• An Attrition Problem of Gambler's Ruin
• scientific article; zbMATH DE number 3976693 (Why is no real title available?)
• scientific article; zbMATH DE number 6416757 (Why is no real title available?)
• On the expectation of the maximum of IID geometric random variables
• Saddle-point Methods for the Multinomial Distribution
• The exact distribution of the maximum, minimum and the range of multinomial/Dirichlet and multivariate hypergeometric frequencies
• The river crossing game

Cited in

(9)

• The mathematics of snakes and ladders
• A finite exact algorithm to solve a dice game
• A Markovian process modeling for Pickomino
• Nearly optimal computer play in multi-player Yahtzee
• Skunk redux
• Let's get rolling! Exact optimal solitaire Yahtzee
• A quantitative study on average number of spins of two-player Dreidel
• `Toss up' strategies
• On a roll again: analysis of a dice removal game

This page was built for publication: An analysis of TENZI using combinatorics and Markov chains

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