Solved game

[citation needed] By contrast, "strong" proofs often proceed by brute force—using a computer to exhaustively search a game tree to figure out what would happen if perfect play were realized.

As a simple example of a strong solution, the game of tic-tac-toe is easily solvable as a draw for both players with perfect play (a result manually determinable).

An ultra-weak solution (e.g., Chomp or Hex on a sufficiently large board) generally does not affect playability.

[1] Based on the rules of a game, every possible final position can be evaluated (as a win, loss or draw).

As an example, the perfect strategy for rock paper scissors would be to randomly choose each of the options with equal (1/3) probability.