If you want a definition of near-perfect play, that still allows for the possibility of a (small) error or two, a very long game (that is well-played) that is a win for one side comes to mind.
You could decide to solve chess and it could be useful for determining piece values - just tag the number of moves a given 'game' of near-perfect chess takes to play until checkmate, and also keep track if B vs. N is involved. Optionally, you could have an engine assessing (albeit not perfectly accurately) who has the advantage (and how much) at every move. This of course is all not practically possible, in today's world at least.
If you want a definition of near-perfect play, that still allows for the possibility of a (small) error or two, a very long game (that is well-played) that is a win for one side comes to mind.
You could decide to solve chess and it could be useful for determining piece values - just tag the number of moves a given 'game' of near-perfect chess takes to play until checkmate, and also keep track if B vs. N is involved. Optionally, you could have an engine assessing (albeit not perfectly accurately) who has the advantage (and how much) at every move. This of course is all not practically possible, in today's world at least.