本文按照这种算法总结出完成四柱汉诺塔游戏之最少步数的公式，并用数学归纳法证明了它。
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.
文章以“汉诺塔”游戏为出发点，分析设计了一个高强度的公平的不可抵赖的签约协议。
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.
文章以“汉诺塔”游戏为出发点，分析设计了一个高强度的公平的不可抵赖的签约协议。
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.
应用推荐