Title of article
On the Frame–Stewart algorithm for the multi-peg Tower of Hanoi problem Original Research Article
Author/Authors
Sandi Klavzar، نويسنده , , Uro? Milutinovi?، نويسنده , , Ciril Petr، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
17
From page
141
To page
157
Abstract
It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be found.
Keywords
Multi-peg Tower of Hanoi problem , Frame–Stewart algorithm , Recursion , Dynamic programming
Journal title
Discrete Applied Mathematics
Serial Year
2002
Journal title
Discrete Applied Mathematics
Record number
885411
Link To Document