全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Solving the Tower of Hanoi with Random Moves

Full-Text   Cite this paper   Add to My Lib

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133