加载中…
2012-03-15
What is the least number of moves needed to solve the k-peg Towers of Hanoi problem?
Roberto Demontis
文献摘要
We prove that the solutions to the k-peg Tower of Hanoi Problem given by Frame and Stewart are minimal.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本