A multi-computational exploration of some games of pure chance

DOI10.1016/J.JSC.2020.04.003MaRDI QIDQ2229699zbMATH OpenOpenAlexFDO

Authors Doron Zeilberger, Thotsaporn Thanatipanonda

Publication date 18 February 2021

Published in Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

symbolic computationexperimental mathematicsgames of pure chance

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Experimental studies (91A90) Probabilistic games; gambling (91A60) Algorithmic game theory and complexity (91A68)

Abstract: In the spirit of "multi-culturalism", we use four kinds of computations: simulation, numeric, symbolic, and "conceptual" to explore some "games of pure chance" inspired by children board games like "Snakes and Ladders" (aka as "Chutes and Ladders") and "gambler's ruin with unlimited credit". Even more interesting than the many computer-generated actual results described in this paper and its web-site extension, is our broad-minded, ecunemical approach, not favoring, a priori, any one of the above four kinds of computation, but showing that, a posteriori, symbolic computation is the most important one, since (except for simulation, that is very inaccurate) numerics can be made more efficient with the help of symbolics (in the "downward" direction), and, (in the "upward" direction) the mere existence of certain symbolic-computational algorithms imply interesting "qualitative" results, that certain numbers are always rational, or always algebraic, and certain sequences are always polynomial, or C-recursive, or algebraic, or holonomic. This article is accompanied by four Maple packages, and numerous input and output files, that readers can use as templates for their own investigations.

Recommendations

• The mathematics of snakes and ladders
• Symbol-crunching with the gambler's ruin problem
• A probabilistic analysis of the Game of the Goose
• A computer algebra approach to the discrete Dirichlet problem
• Markov chains to compute expected game lengths of ``chutes and ladders

Cites work

• scientific article; zbMATH DE number 45266 (Why is no real title available?)
• scientific article; zbMATH DE number 872231 (Why is no real title available?)
• scientific article; zbMATH DE number 5252403 (Why is no real title available?)
• scientific article; zbMATH DE number 3059214 (Why is no real title available?)
• A holonomic systems approach to special functions identities
• A problem of arrangements
• A quantitative study on average number of spins of two-player Dreidel
• Catalan Numbers
• GFUN
• Gambler's ruin: the duration of play
• The \(C\)-finite ansatz
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• The method of differentiating under the integral sign
• The on-line encyclopedia of integer sequences

Cited in

(7)

• Strange spinners and diversity of dice in chutes and ladders
• Random Perturbation in Games of Chance
• A computer algebra approach to the discrete Dirichlet problem
• A probabilistic analysis of the Game of the Goose
• Symbol-crunching with the gambler's ruin problem
• The mathematics of snakes and ladders
• Rigorous Computer Analysis of the Chow–Robbins Game

Describes a project that uses

Uses Software

• DEtools
• Cfinite
• OEIS
• Maple
• gfun

This page was built for publication: A multi-computational exploration of some games of pure chance

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