Name
Abstract | ||
|---|---|---|
We prove the exact formulae for the expected number of moves to solve several variants of the Tower of Hanoi puzzle with 3 pegs and n disks, when each move is chosen uniformly randomly from the set of all valid moves. We further present an alternative proof for one of the formulae that couples a theorem about expected commute times of random walks on graphs with the delta-to-wye transformation used in the analysis of three-phase AC systems for electrical power distribution. |
Year | Venue | Field |
|---|---|---|
2013 | CoRR | Discrete mathematics,Graph,Combinatorics,Tower,Random walk,Expected value,Mathematics |
DocType | Volume | ISSN |
Journal | abs/1304.3780 | In: The Mathematics of Various Entertaining Subjects: Research in
Recreational Math, Princeton University Press, 2016, pp. 65-79. ISBN
978-0-691-16403-8 |
Citations | PageRank | References |
1 | 0.35 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Max A. Alekseyev | 1 | 403 | 39.45 |
| Toby Berger | 2 | 90 | 24.05 |