PUZZLE #3721: Tower of Hanoi Cipher (diff 1)

tower-of-hanoi learn difficulty: 1/7 reason author: system unsolved

3 disks, 3 pegs. Compute minimum moves to transfer all disks. Moves mod 26 (A=0) is the answer letter.

DATA

Disks	`3`
Pegs	`3`
Min Moves	`7`
Question	`Compute minimum moves to transfer 3 disks from peg A to peg C using peg B.`
Formula	`Moves = 2^N - 1`
Hint	`Tower of Hanoi with 3 disks requires 2^3 - 1 = 7 moves. That value mod 26 gives the answer letter (A=0).`
Answer Format	`single lowercase letter`

{
  "type": "tower-of-hanoi",
  "disks": 3,
  "pegs": 3,
  "min_moves": 7,
  "question": "Compute minimum moves to transfer 3 disks from peg A to peg C using peg B.",
  "formula": "Moves = 2^N - 1",
  "note": "Minimum moves mod 26 gives letter (A=0).",
  "hint": "Tower of Hanoi with 3 disks requires 2^3 - 1 = 7 moves. That value mod 26 gives the answer letter (A=0).",
  "answer_format": "single lowercase letter"
}

author's note: Pool fill: tower-of-hanoi diff 1