gniibe Distributed Hanoi Protocol

I wrote original version of this page in 2004. Here, I reformat it in reStructured text.

We can play this protocol by three persons with disks.

We played in Singapore, Hanoi, Karlsruhe, Beijing, and Tokyo.

gniibe Distributed Hanoi Protocol

Terms

  • Disk
  • Tower

Initial condition

  • One is SOURCE who has all disks.

  • Another is DESTINATION.

  • The other is AUXILIARY.

  • If number of disks is odd:

    • SOURCE faces to DESTINATION

    or else (even)

    • SOURCE faces to AUXILIARY

  • DESTINATION and AUXILIARY face to SOURCE

The protocol

Each tower does repeat the following steps until finish:

  1. Exchange
    1. Compare the size of top of disks of two towers (No disk means infinite size).
    2. Winner is those who has bigger disk on the top of the tower.
    3. Winner get the top disk from loser's tower, and put it on top of the tower.
  2. Turn
    • Turn to another tower.

End detection

  • When two towers compares no disk, that's end of the game.

Figure

When this figure doesn't move, try this.

GDHP in action