最終更新日：2024/07/30

A puzzle in which stacks of disks are moved one at a time from one of three spindles to another so that no disk ever rests on a smaller disk.

正解を見る

towers of Hanoi

問題を編集する

元となった辞書の項目

towers of Hanoi

noun

A puzzle in which stacks of disks are moved one at a time from one of three spindles to another so that no disk ever rests on a smaller disk.

The towers of Hanoi puzzle is a classic problem in computer science.

意味（1）

A puzzle in which stacks of disks are moved one at a time from one of three spindles to another so that no disk ever rests on a smaller disk.