How to Win at Tenzi

DOI10.1080/07468342.2020.1774296MaRDI QIDQ5856130zbMATH OpenOpenAlexFDO

Authors Steve J. Bacinski, Timothy J. Pennings

Publication date 24 March 2021

Published in The College Mathematics Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/07468342.2020.1774296

Mathematics Subject Classification ID

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) Operations research, economics (aspects of mathematics education) (97M40) Distributions and stochastic processes (educational aspects) (97K60)

Recommendations

• scientific article; zbMATH DE number 3915324
• How to win a game with features
• How to win a game with features
• How to win some simple iteration games
• The Teneva game
• How to win at (One-Round) War
• Games and winning strategies

Cites work

• Understanding Markov chains. Examples and applications

Cited in

(4)

• scientific article; zbMATH DE number 1921299 (Why is no real title available?)
• `Toss up' strategies
• How to beat Capablanca
• An analysis of TENZI using combinatorics and Markov chains

This page was built for publication: How to Win at Tenzi

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