みんな大好きな？ハノイの塔を作りたくなって作りました。 ルール ・左の塔を右に動かす ・円盤を一回につき一個動かす ・小さい円盤の上にそれより大きな円盤はのせられない Rule · Move the left tower to the right · Move one disk at a time · You can not put larger discs on smaller discs
Music:魔王魂 http://maoudamashii.jokersounds.com/ Cloud list:@yaya3156 https://scratch.mit.edu/projects/25079416/ Explanation about the Tower of Hanoi: https://ja.wikipedia.org/wiki/%E3%83%8F%E3%83%8E%E3%82%A4%E3%81%AE%E5%A1%94 The tower of Hanoi is a kind of puzzle and it is played all over the world. It's strongly related to mathematics and programming. For example, -It takes at least 2ⁿ-1 steps to move all n disks -Recursive algorithm valid for solution -The state moved n times from the initial state can be uniquely obtained from binary notation of n .... There is a legend in the Tower of Hanoi. That is to say that moving the whole 64 Hanoi towers built in Varanasi will bring the world to an end. (To move 64 disks, it takes at least 18, 446, 744, 073, 709, 551, 615 times, and if it takes 1 second to move one piece, it takes at least 584.5 billion years)
