本文按照这种算法总结出完成四柱汉诺塔游戏之最少步数的公式,并用数学归纳法证明了它。
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.
“如果是在玩游戏,那我会关掉电脑,但我要用它来工作啊,”雷塔诺沮丧地说道。
"If I was playing computer games, I'd turn off the computer, but I need it to work," the frustrated professor said.
文章以“汉诺塔”游戏为出发点,分析设计了一个高强度的公平的不可抵赖的签约协议。
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.
应用推荐