At every point in time there are a range of moves with different levels of optimality. That range changes at the next point in time following the opponent's move.
The optimal strategy can be determined from the current state. This is the principle behind minimax.
In a perfect information zero sum game, we can theoretically draw a complete game tree, each terminal node ending with a win, loss, or draw. With a full understanding of the game tree we can make moves to minimize our opponent’s best move.
Therefore the best move cannot be determined by the current board state, as it cannot be determined in isolation from the opponents strategy.