The Computer Solves the Three Tower Problem

DOI10.2307/2324818MaRDI QIDQ4039085zbMATH OpenOpenAlexFDO

Authors Arthur Engel

Publication date 5 January 1994

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2324818

zbMATH Keywords

games of chance

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50)

Recommendations

• On the N-tower problem and related problems
• scientific article; zbMATH DE number 621885
• Three-handed gambler's ruin
• A random stacking process
• scientific article; zbMATH DE number 830055

Cited in

(14)

• A random stacking process
• Three-handed gambler's ruin
• Solution to the N -player gambler’s ruin using recursions based on multigraphs
• THE MULTIPLE-PLAYER ANTE ONE GAME
• A matrix-analytic approach to the N-player ruin problem
• A novel version for three-player gambler's ruin problem
• Variance of the asymmetric n-player gambler’s ruin problem with ties allowed
• Variance of the game duration in the gambler's ruin problem
• Reaching consensus on a connected graph
• Gambler's ruin and the ICM
• Make Puzzles Great Again
• On the N-tower problem and related problems
• The Toilet Paper Problem
• scientific article; zbMATH DE number 2164131 (Why is no real title available?)

This page was built for publication: The Computer Solves the Three Tower Problem

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