{"id":"tower-of-hanoi","domain":"recreational","type":"Concept","title":"Tower of Hanoi","slug":"tower-of-hanoi","url":"/mathematics/recreational/tower-of-hanoi/","invented":"1883, Édouard Lucas","summary":"Puzzle requiring exactly 2^n-1 moves for n disks. Classic example of recursion and exponential growth.","formula":"T(n) = 2^n - 1","added_to_codex":"2026-05-27","last_verified":"2026-05-27","sources":[{"tier":1,"citation":"Graham, R.L., Knuth, D.E. and Patashnik, O. (1994). Concrete Mathematics. 2nd ed. Addison-Wesley."},{"tier":2,"citation":"Hinz, A.M., Klavžar, S. and Petr, C. (2018). The Tower of Hanoi — Myths and Maths. 2nd ed. Birkhäuser."},{"tier":2,"citation":"Bousch, T. (2014). La quatrième tour de Hanoï. Bulletin de la Société Mathématique de France."},{"tier":3,"citation":"Petković, M.S. (2009). Famous Puzzles of Great Mathematicians. American Mathematical Society."}],"relationships":[{"type":"illustrates","target":"graph-theory","label":"Graph Theory — state-space structure"}],"entry_status":"live","reading_levels_available":["curious","exploring","deep_dive"],"completeness":1.0,"codex_version":"1.6"}