Introduces the weighted Tower of Hanoi with move costs and presents an optimal dynamic programming algorithm for minimum total cost.
Récréations mathématiques , volume 2
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The weighted Tower of Hanoi
Introduces the weighted Tower of Hanoi with move costs and presents an optimal dynamic programming algorithm for minimum total cost.