For example, lets say a players has two options.
One is a mate in 20, but for every single of the 20 moves, the 2nd best move loses (or draws) instantly. Meaning the player must find all 20 moves.
The 2nd choice is a move that objectively makes the game a draw, but now the opponent is forced to play perfectly for 20 moves or they will instantly lose.
We will also say that the position is very difficult, and requires tremendous calculation for either player to find the best moves.
---
The practical choice is clear. Everyone would choose the move that makes the game objectively drawn, and every person who chose this would go on to win the game.
And even further, choosing the move that is a forced mate would be called a horrible blunder.
---
To a lesser extent this happens all the time in top level chess.
Yesterday in the Candidates tournament, Karjakin chose the move h4 vs Kramnik's ridiculously solid semi-tarrasch.
Karjakin won even though h4 very clearly not objectively best.
During that same game when Kramnik chose the move f5, I'm reasonably certain Kramnik knew this move was not objectively best, possibly even fairly bad, but by sharpening the game he purposefully created more chances for both sides to blunder and therefore more chances for himself to win.
---
Even comparatively very low level players like myself make decisions like this, if only in our opening repertoire.
I'm using EGTB as shorthand for a 32 man EGTB.
Remember a 32 man EGTB has the true evaluation for every single possible position in chess (about 10^42 IIRC).
Of course the EG part of the designation is a little silly, because by the time you have a 32-man EGTB we're not talking about the endgame anymore, but I use EGTB to remind you that the only evaluations really are "mate in __" and "draw" and that every possible position has been evaluated and stored.
---
And yes, now, for the 3rd time, I'm telling you if every single position in the game were evaluated as drawn, then we would say it's a perfect game (under our current definition of perfect).
Yes, under the more usual definition of perfect, a player will play to win, and never make a mistake. This is much trickier to make a definition for since playing for a win often means playing an objectively less-than-best move (because it creates more practical problems for the opponent).
Playing for a win can only mean playing objectively less than perfect moves, if you are playing against something or someone that is fallible.
In terms of the thread topic, which is chess being solved, playing for a win can only objectively mean playing the (objectively) best moves.
Do I think games have been played where current computer assessments from start to finish is near 0, of course. I just think that’s a strange criteria for which to deem a game “perfect.” But if that’s where you’ve been going with us the whole time, I don’t disagree with you.