Games {tower of Hanoi} can use a horizontal board with three vertical pegs. Discs are on one peg, with largest on bottom. The idea is to transfer discs to another peg to recreate same series, without ever putting a larger disc on a smaller-disc top. With n discs, it requires 2^n - 1 transfers.
Mathematical Sciences>Topology>Problems
Outline of Knowledge Database Home Page
Description of Outline of Knowledge Database
Date Modified: 2022.0224