北京大学学报(自然科学版)

四柱汉诺塔之初步探究

杨楷, 徐川   

  1. 北京大学计算机科学与技术系,北京,100871
  • 收稿日期:2003-02-27 出版日期:2004-01-20 发布日期:2004-01-20

The Preliminary Probe of 4-Peg Hanoi Tower

YANG Kai, XU Chuan   

  1. Department of Computer Science and Technology, Peking University, Beijing, 100871
  • Received:2003-02-27 Online:2004-01-20 Published:2004-01-20

摘要: 1941年,J.S.Frame在《美国数学月刊》上提出了一种解决四柱汉诺塔问题的算法,但未给出最终公式的证明。本文按照这种算法总结出完成四柱汉诺塔游戏之最少步数的公式,并用数学归纳法证明了它。

关键词: 四柱汉诺塔, 区, 剩余盘数R(n)

Abstract: In 1941,J.S.Frame gave out an algorithm in American Mathematical Monthly to solve the problem of 4-peg Hanoi Tower, but he did not provide the proof for the final formulae. According to that algorithm, this article puts forward a formula to calculate the number of movements necessary for the 4-peg Hanoi Tower problem, and proves it using mathematical induction.

Key words: 4-peg Hanoi Tower, zone, the number of remaining disks R(n)

中图分类号: