@5632
"Relying on humans to be "good" just doesn't seem to fit with what you're trying to prove."
++ Here is an example. https://www.iccf.com/game?id=1164259 
The 2 ICCF grandmasters agree to a draw as neither side can win.
i.e. Neither grandmaster with strictly limited lookahead capability can win.
An engine might continue a long time before reaching a 3-fold repetition in all variations.
When you still wouldn't know what the theoretical result was.
Er, talking about engines, have you overlooked my final comments in this post, by the way?
We're witnessing a clash between the old way of "doing science" and the new. Although my heart is with the older way, I believe tygxc needs to adjust his wording to reflect that difference, particularly regarding the proper meaning of deduction. Then all should be well.
No, we are not.
Solving a game is not science. It is basically a maths problem associated with the theory of combinatorial games. It is of course of very minor interest to the theoretical subject which concerns itself with general results, but is of interest because of the historical status of the game itself (and as a motivation to develop efficient procedures to do such things).
By contrast, the four colour theorem is natural and fundamental, involving no arbitrary set of parameters (such as the rules of chess), and the same is true of many general theorems of combinatorial game theory.
The task that can be achieved by a "scientific" approach (i.e. inductive reasoning from empirical information) is a different one. Specifically, you can arrive at results that are uncertain (eg according to model M, there is a high probability that the optimal result is R) and approximate (eg strategy S probably loses very rarely), by contrast with a type of mathematical proposition that is certain and precise, achieved by rigorous deduction.