Siderite / Siderite/lichessTools
A way to determine the frequency of blunders (on each side) from a certain position
Nobody has claimed this yet.
- Dominant language
- JavaScript
- Stars
- 92
- Forks
- 20
- Avg merge
- 19h 59m
- Merged PRs (30d)
- 1
Description
As difficult it is to determine the move that lead to a victory in a game, it is relatively easy to do it statistically. After all, a victory in chess is inducing the opponent to blunder. If we could measure the number of blunders per person per move after a certain position, we could determine a measure of "trickiness" which would be very valuable in finding interesting variations.
The problem here is that the information is on the server side and a client solution is probably unfeasible. Some sort of MCTS strategy could work, but it would use too many resources.
This issue is just to try to find solutions, rather than implement them.
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 files, tests, or entry points are named. Start by assessing whether the required server-side information is available to the browser extension and whether an MCTS approach fits the resource limits; this issue is complete only when a concrete, feasible solution is defined.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- javascript
- Domain
- analytics
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100