Correct Hanoi formula for minimum number of moves in the docs (#397)

shlomif · Oct 13, 2024 · df8d05e · df8d05e
1 parent 66995ae
commit df8d05e
Showing 1 changed file with 2 additions and 1 deletion.
diff --git a/html-src/rules/hanoipuzzle.html b/html-src/rules/hanoipuzzle.html
@@ -26,4 +26,5 @@ <h3>History</h3>
 puzzle.  It is traditionally played with different size disks.
 <p>
 For a given number of cards, the minimum number of moves to solve
-the puzzle is one less than double the number of cards (2n - 1).
+the puzzle is one less than two to a power of the number of cards
+(2^n - 1).