> I computed a simple “error score” that includes mistakes while giving blunders more weight: [number of mistakes] × 2*[number of blunders]
This doesn't give blunders more weight..
Multiplication is commutative and associative, so the author's formula is also the same as this one: 2*[number of mistakes] × [number of blunders]
To give more weight to blunders, you could use an exponent, which is a common trick in baseball statistics (SABRmetrics), like this: [number of mistakes] × [number of blunders ^ 1.1]
It's possible, but that formula is (after a log2 transformation) equivalent in comparison power to log2(mistakes) + blunders. This is almost reducing the mistake term to a tiebreaker, because mistakes and blunders are on the same scale (a proportion of the number of actions taken in a game).
This doesn't give blunders more weight..
Multiplication is commutative and associative, so the author's formula is also the same as this one: 2*[number of mistakes] × [number of blunders]
To give more weight to blunders, you could use an exponent, which is a common trick in baseball statistics (SABRmetrics), like this: [number of mistakes] × [number of blunders ^ 1.1]
See e.g. some of the formula concepts invented by Bill James https://en.wikipedia.org/wiki/Bill_James#Innovations