{
  "title": "The 7 moves for 3 disks",
  "description": "The 7 moves that solve the three-disk Tower of Hanoi by the recursive method, from peg A to peg C, with the position after each move (disk 1 is the smallest; lists run bottom to top); every move was replayed and checked legal. Also the number of moves per disk in the 255-move solution for 8 disks. Computed 2026-10-31. License CC BY 4.0.",
  "license": "CC BY 4.0",
  "license_url": "https://creativecommons.org/licenses/by/4.0/",
  "creator": "Puzzles, Charts & Dilemmas",
  "page": "https://puzzleschartsanddilemmas.com/puzzles/tower-of-hanoi/",
  "derived_from": [
    "Puzzle rules as stated in Édouard Lucas, Récréations mathématiques, vol. 3 (Paris: Gauthier-Villars, 1893), p. 55, https://archive.org/details/rcrationsmat03lucauoft (public domain)"
  ],
  "method": "Compiled by Puzzles, Charts & Dilemmas from the data listed"
}