This question is an offshoot of Ramon Snir's earlier one about how often different types of pieces get moved, on average, in a game of chess. My question:

Do the relative numbers of moves for the given types of pieces differ when one looks at the games of stronger players as opposed to the games of weaker players? (For example, maybe the weaker players tend to make more pawn moves at the expense of piece moves, or they make too many queen moves. I don't know.)

I was able to give an answer to the earlier question using raw data that had been extracted from a large database by someone else. That data came from a sample of 4M+ games, ranging from grandmaster play down to weak amateur play, and the aggregate numbers for move totals that are given there don't discriminate on the basis of player strength. Answering my question will require getting separate data for games between strong players and games between weak players, and I am looking for answers backed up by data rather than anecdotes.

Here's a more specific form of my question:

Is there some Elo rating threshold N such that, when one looks at the average numbers of moves in a game broken down by type of piece, there's a significant difference between what one finds in games featuring players above N, and what one finds in games featuring players below N.

It would be interesting if more of this sort of thing could be found too, i.e. concrete differences between stronger and weaker players that can be detected by data mining. Such findings could point to specific behaviors that hold players back, or conversely ones that propel them forward. Now, maybe there aren't any such differences to be found just by looking at this kind of data, but I'd be interested to know that too.