The Tower of Hanoi is solved using these rules: - Only one disc can be moved at a time. - Only the top disc of one stack can be transferred to the top of another stack or an empty rod. - Larger discs cannot be stacked over smaller ones.
vdfex 发表于 2024-03-29 16:33 The Tower of Hanoi is solved using these rules: - Only one disc can be moved at a time. - Only the top disc of one stack can be transferred to the top of another stack or an empty rod. - Larger discs cannot be stacked over smaller ones.
不是从头开始的呀。
太多重复无用的步骤？