漢諾塔（Tower of Hanoi）源於19世紀法國數學家愛德華·盧卡斯提出的數學謎題，是邏輯思維與遞迴算法的經典案例。本遊戲完美還原這一益智經典，並加入多項現代遊戲功能。
遊戲規則：
- 共有三根塔柱：起始塔座、輔助塔座、目標塔座
- 初始狀態下，所有圓盤按大小順序疊放在起始塔座（大盤在下，小盤在上）
- 目標：將所有圓盤移至目標塔座，保持原有順序
- 每次只能移動一個圓盤
- 大圓盤不能放在小圓盤上方
遊戲特色：
- 六種難度：3至8個圓盤，最優解從7步到255步
- 精美山水背景，彩色漸層圓盤，視覺效果出色
- 背景音樂與音效，全程沉浸式體驗
- 計時功能，記錄每關完成時間
- 最佳記錄儲存，不斷挑戰自我最優解
- 撤回功能（觀看廣告解鎖），後悔藥隨時吃
- 智能提示（觀看廣告解鎖），BFS算法計算最優下一步
- 重置按鈕，一鍵重新挑戰
- 全螢幕自適應，手機電腦皆可暢玩
數學小知識： N個圓盤的漢諾塔最少需要 2ⁿ-1 步完成：
- 3個圓盤：最少7步
- 4個圓盤：最少15步
- 5個圓盤：最少31步
- 8個圓盤：最少255步
挑戰自己，用最少步數完成每一關！
操作方式：
- 點擊/觸碰塔柱選擇要移動的圓盤
- 再次點擊目標塔柱完成移動
- 無效移動會有提示音效
The Tower of Hanoi is a mathematical puzzle invented by French mathematician Édouard Lucas in 1883. It remains one of the most elegant examples of recursive thinking and logical problem-solving.
Game Rules:
- Three pegs: Start, Auxiliary, and Target
- All discs begin stacked on the Start peg (largest at bottom, smallest on top)
- Goal: Move all discs to the Target peg maintaining the same order
- Only one disc can be moved at a time
- A larger disc cannot be placed on top of a smaller disc
Features:
- Six difficulty levels: 3 to 8 discs (optimal solutions range from 7 to 255 moves)
- Beautiful landscape background with colorful gradient discs
- Background music and sound effects for immersive gameplay
- Timer to track your completion time for each level
- Best record storage to track your personal bests
- Undo feature (ad-supported) to take back your last move
- Smart hint system (ad-supported) using BFS algorithm for optimal next move
- Reset button to restart anytime
- Fullscreen responsive design for mobile and desktop
Math Fact: N discs requires a minimum of 2ⁿ-1 moves:
- 3 discs: 7 moves minimum
- 4 discs: 15 moves minimum
- 5 discs: 31 moves minimum
- 8 discs: 255 moves minimum
Challenge yourself to solve each level with the fewest moves possible!
Controls:
- Click/tap a peg to select the top disc
- Click/tap the destination peg to move
- Invalid moves trigger an error sound and visual shake