汉诺塔问题是典型的只有用递归方法才能解决的问题。
Tower of Hanoi is a typical problem that can only be solved using recursive method.
汉诺塔问题古老而有趣，是经常用作程序设计递归算法的典型例题。
Hnaoi Problem is an old-aged yet interesting one, which is often used as an typical example for recursive algorithm in program design.
文章以“汉诺塔”游戏为出发点，分析设计了一个高强度的公平的不可抵赖的签约协议。
According to the" nono n-repudiation game of Hanoi Tower", This paper analyzes a fair and non-repudiation signed-contract-cryptographic-protocol(SCCP)with strong safety.
汉诺塔问题：有ABC三根柱子，A柱上有n个大小不等的盘子，大盘在下，小盘在上。
Tower of Hanoi problem: There are three pillars ABC, A column has n different sizes of plates, the broader market in the next, small cap on.
本文按照这种算法总结出完成四柱汉诺塔游戏之最少步数的公式，并用数学归纳法证明了它。
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.
三项视空间记忆任务与解决汉诺塔问题的成绩相关也显著，而数字短时记忆、数字工作记忆与汉诺塔问题成绩相关不显著。
Solution time on the Tower of Hanoi task correlated highly with two centre executive tasks and three spatial spans, but not with the verbal working memory span.
详细说明：汉诺塔问题。程序结果：给出程序执行过程中栈的变化过程与圆盘的搬动状态。- Towerof Hanoi problem。
Application results: the execution of a program is given the changing process of the stack and moving state of the disk.
详细说明：汉诺塔问题。程序结果：给出程序执行过程中栈的变化过程与圆盘的搬动状态。- Towerof Hanoi problem。
Application results: the execution of a program is given the changing process of the stack and moving state of the disk.
应用推荐