![]() Registered Member ![]()
|
I am thinking of new score calculation for KNetWalk.
Current score calculation: penalty = time/2 * (clicks/2 + 1) penalty = sqrt(penalty/no of cells) score = 100/penalty My proposal: score = time + (clicks/2 * 10) less score gets on top If there are any KNetWalk players around here, please give some suggestions. |
![]() Registered Member ![]()
|
Some thoughts on this:
* Both calculations miss the difference between hard and very hard, the latter one has no distinction between levels at all (which is more consistent). What about adding an offset or factor to acknowledge the more difficult level? * I don't know if including the penalty is really necessary. If I missclick I usually also take more time. On the other hand I always have the impression the aim is to finish as fast as possible but making mistakes is really bad (a bit like minesweeper), and the scores reflect that. Not sure. * A linear relationship between time and score does not really reflect the difficulty. Going from 2:00 minutes to 1:50 is relatively easy compared to going from 1:30 to 1:20. Maybe having some data helps, so I put my High Scores at http://paste.ubuntu.com/5707030/. |
![]() Registered Member ![]()
|
I think first decision we need to take whether to consider misclicks or not
|
Registered users: Baidu [Spider], Bing [Bot], Google [Bot]