lewxdev / tower-of-hanoi

Unleash your skills with this free online, mobile-friendly, minimal Tower of Hanoi game. Can you solve each puzzle in the least number of moves?
https://lewxdev.github.io/tower-of-hanoi/
0 stars 0 forks source link

Implement `scoreMultiplier` Logic #8

Closed lewxdev closed 1 year ago

lewxdev commented 1 year ago

Implement logic and display for score multiplier.

The multiplier itself is a number between 0.0 and 1.0 produced by an equation that takes the inputs of the number of moves, and minimum number of moves. Between move 0 and the minimum move count (exclusive), the multiplier should remain 0.0. The multiplier should then be 1.0 the minimum move count and progressively decrease as more moves are made