A multi-computational exploration of some games of pure chance

DOI10.1016/j.jsc.2020.04.003zbMath1466.91066arXiv1909.11546OpenAlexW3017901058MaRDI QIDQ2229699

Doron Zeilberger, Thotsaporn ``Aek 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) Probabilistic games; gambling (91A60) Experimental studies (91A90) Algorithmic game theory and complexity (91A68)

Uses Software

• gfun
• Maple
• OEIS
• Cfinite
• DEtools

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• The method of differentiating under the integral sign
• A holonomic systems approach to special functions identities
• The \(C\)-finite ansatz
• A problem of arrangements
• Gambler’s Ruin: The Duration of Play
• GFUN
• The on-line encyclopedia of integer sequences
• Catalan Numbers
• A quantitative study on average number of spins of two-player Dreidel

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