From df8d05e0c51a3233b96548798c767f2a033879bd Mon Sep 17 00:00:00 2001 From: Joe R Date: Sun, 13 Oct 2024 14:20:46 -0400 Subject: [PATCH] Correct Hanoi formula for minimum number of moves in the docs (#397) --- html-src/rules/hanoipuzzle.html | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/html-src/rules/hanoipuzzle.html b/html-src/rules/hanoipuzzle.html index e194878d..8f43ed27 100644 --- a/html-src/rules/hanoipuzzle.html +++ b/html-src/rules/hanoipuzzle.html @@ -26,4 +26,5 @@ Hanoi Puzzle is a card-based version of the classic Tower of Hanoi puzzle. It is traditionally played with different size disks.

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).