Alex_Svitashev wrote on 04/24/13 at 02:58:06:
If someone asked you to assert this percentage of correct choice of a World Chess Champion, a Grandmaster or for an average player, what would your best guess be?
If you had access to an enormous database of chess games, how would you use this information to answer the question?
There are a lot of assumptions/opinions in the OP.
Interpreting the last question as "how would you use a large database to study the rate of
best moves played by an average, GM or WC player ?" :
First I would define a
best move in some game-theoretic setting. Two main possibilities :
a) best moves in a position are those maintaining the initial status of the position (win, draw, lose). In this respect, all moves are equally best if they maintain a winning position, and all moves are equally best in a losing position, since none can improve the evaluation of the position. Note that this status in not always known, as chess isn"t solved yet.
b) you can define additional metrics such as "in winning position: shortest distance to mate" or "in losing position: maximum severity of winning sequences", with such severity related to some probability that the opponent loses its winning status, or any other criteria you see fit.
Having chosen a metric you're happy with, you can take a subset of measurable chess positions (e.g. ending tablebases when the metric is either distance to mate or position status), and check your big game database against it. For each position both in the tablebase and in the gamebase, you can score the frequency of (or distance to) "best moves" played in each category.
That's what I would do anyway if life wasn't so damn short.