Towers of Hanoi

Bring Towers of Hanoi game to your Google Chrome!

用户数670

评分4.6

评论数7

Manifest 版本V3

7日增长-25

7日增长率-3.6%

视觉预览

Towers of Hanoi 媒体预览

2 项素材

趋势

30 日用户趋势

查看最近 30 天的用户变化。

用户增长趋势

评分趋势

30 日评分变化

按时间查看评分波动，辅助判断近期口碑是否稳定。

30 日评分变化

起始值

4.57

日/周/月增长表现

同口径展示 1 天、7 天、30 天的绝对增长与增长率。

1日增长减少

-6-0.89%

7日增长减少

-25-3.6%

30日增长减少

-34-4.83%

技术摘要

版本、语言与抓取信息

查看发布时间、版本、支持语言、最近更新和抓取时间。

版本1.0.1

ManifestV3

大小194KiB

语言数1English

发布时间--

插件简介

查看插件说明、主要功能和适用场景。

Towers of Hanoi classical puzzle, shift the tower without placing a large piece on a smaller one. A great challenge for smart people!

Play more games on the left-bar menu

The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower and sometimes pluralized) is a mathematical game or puzzle. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.

The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:

- Only one disk can be moved at a time.

- Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.

评价