Hanoi graph (Tower of Hanoi Tower of Hanoi)
Jump to navigation
Jump to search
Time Complexity
$O({2}^n)$
Space Complexity
bits
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2008
Reference
https://books.google.com/books/about/Topics_in_Graph_Theory.html?id=pSv3XotPCQgC