What is the least number of moves needed to solve the k-peg Towers of Hanoi problem?
2019
We prove that the solutions to the 4-peg Tower of Hanoi Problem given by Frame and Stewart are minimal.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
8
References
3
Citations
NaN
KQI