Tower of Hanoi 河內塔

3.6M5,000+
Puzzle
2.7
Tower of Hanoi 河內塔 Screen Shot 0Tower of Hanoi 河內塔 Screen Shot 1Tower of Hanoi 河內塔 Screen Shot 2Tower of Hanoi 河內塔 Screen Shot 3Tower of Hanoi 河內塔 Screen Shot 4Tower of Hanoi 河內塔 Screen Shot 5

Tower of Hanoi 河內塔

Tower of Hanoi is a classic mathematical game. Traditional one consists of three rods, but our version can consist of three to four rods, and a few discs of different sizes which can be moved onto any rod. The puzzle starts with the discs in a stack in ascending order of size on one rod, the smallest at the top and the largest at the bottom, thus making a conical shape. The goal is to move the entire stack to another rod, obeying the following rules: 1. Only one top most disc can be moved at a time. 2. Each move consists of taking the top most disc from one of the stacks and placing it on top of another stack. 3. No larger disc may be placed on top of a smaller disc. With N discs, the puzzle can be solved in no more than 2^N - 1 moves. 河內塔是一個經典數學遊戲。傳統的由三根桿以及不同大小的碟子組成,但我們的版本可包括三到四根桿。開始時碟子由大到小疊起成圓錐形在一根桿,我們的目標是把碟子移到另一根桿,遵守以下規則: 1.只有頂部的碟子可以被移動。 2.每次取頂部的碟子,並把它放在另一根桿的頂部。 3.較大的碟子不可放置在一個較小的碟子的頂部。 如果有N隻碟子,可以用在不超過2 ^ N - 1次移動去解決。快動腦筋,挑戰腦袋!
자세히보기

새로운 기능

version 1.0

정보

  • ID:com.bestsoft2go.hanoi.en
  • 범주:Puzzle
  • 업데이트 됨:2014-09-27
  • 버전:1.0
  • 요구:Android 2.3
  • 사용 가능한:Google Play
  • 파일 크기:3.6M