anthonycicc/PySolFC
1
0
Fork 0
mirror of https://github.com/shlomif/PySolFC.git synced 2025-04-05 00:02:29 -04:00
Code Releases Activity

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

Browse source
This commit is contained in:
Joe R 2024-10-13 14:20:46 -04:00
parent 66995aedaf
commit df8d05e0c5
1 changed files with 2 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
html-src/rules/hanoipuzzle.html
View file

@ -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. puzzle. It is traditionally played with different size disks.
<p> <p>
For a given number of cards, the minimum number of moves to solve 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).