Quote:
Originally Posted by Caleb Sykes
What he is describing sounds similar to this method |
I should probably have asked Whatever to dis-ambiguate his algorithm before commenting on it (which is my usual modus operandi).
But taking his post at face value, this is how I interpreted what he wrote (my comments in
[red]):
Quote:
It uses this algorithm:
1. for each robot -> (sum of scores)[sum of scores for all alliances on which that robot participated] / matches[number of matches that robot played] / (robots per match[number of robots on an alliance]) --> uses this as initial OPR
2. Estimates the score [two alliance scores] for each match using [the estimated] OPR [by summing the estimated OPR score for each robot on each of the two alliances in that match]
3. Calculates error [for each alliance score] using (real score) - (estimated score)
4. Calculates a new OPR using (OPR) [OPR from previous iteration] + [(sum of error [algebraic sum of all 2*M errors (aka residuals) from Step3, where M=#of matches in the event])/(robots per match[number of robots per alliance])/(# of matches per robot[number of matches the robot whose OPR you are re-estimating played])]
5. Then keep looping back to 2 until I got sick of copying columns (roughly 50 times).
|
If the above is the correct interpretation of what Whatever meant, it's completely different form wgardner's post you linked.