``Pass the buck on a complete binary tree

DOI10.1080/0025570X.2022.2094165MaRDI QIDQ5048684zbMATH OpenOpenAlexFDO

Authors Kenneth M. Levasseur

Publication date 16 November 2022

Published in Mathematics Magazine (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Combinatorial games (91A46)

Abstract: The Stochastic Abacus is employed to compute winning probabilities at each level of the game Pass the Buck on a complete binary tree with the starting vertex being the root of the tree. The derivation is also generalized to play on complete k-ary trees.

Recommendations

• Passing the Buck and Firing Fibonacci: Adventures with the Stochastic Abacus
• scientific article; zbMATH DE number 3900780
• The buck-passing game
• scientific article; zbMATH DE number 3978021
• A probabilistic analysis of the Game of the Goose

Cites work

• Chip-firing games on graphs
• scientific article; zbMATH DE number 3514781 (Why is no real title available?)
• Passing the Buck and Firing Fibonacci: Adventures with the Stochastic Abacus
• Prof. Engel’s Marvelously Improbable Machines
• Why does the probabilistic abacus work?

Cited in

(3)

• “Pass the Buck” on a Rooted Tree
• Resistance distances and Kirchhoff indices in graph joins
• The Game of Pass the Buck and the Markov Chain Tree Theorem

This page was built for publication: ``Pass the buck on a complete binary tree

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