use better estimated combo for simulate scores with misses
Open
Nobody has claimed this yet.
suggestion
- Dominant language
- Rust
- Stars
- 117
- Forks
- 27
- Avg merge
- 4m
- Merged PRs (30d)
- 3
Description
a simulated score with misses should show as the combo the expected value for the longest combo if the misses are distributed randomly, rather than the max combo of the map.
It can be calculated like this:def expected_longest_combo(max_combo, misses): return round(max_combo/(misses+1) * sum(1/i for i in range(1, misses+2)))(derivation here)
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
No file, test, or entry point is named. Start by locating the simulated-score combo calculation in the Rust code, then trace how misses are passed into it. Done means simulated scores with misses use the expected longest-combo calculation described in the issue, with behavior checked for representative miss counts.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- game-dev
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 48/100