Chess could be solved in the way that we could map every possible move and counter move.
Except I didn't know what you were trying to write. I think humans could possibly solve it (though probably with some computer assistance) in time, but not by mapping every possible move and counter move. And I really doubt humans will ever have a strong solution.
In that case you can never realy say you have solved it, because it Will always be a move unacounted for.
Not true. I can post you a reliable method of winning any winning KRK position that accounts for all possible opponent's moves but doesn't map every possible move and counter move.
There are many such expositions, though some don't reliably win under competition rules.
Sorry for the missunderstanding. I totally agree. We are talking about the same thing. Schematic moves does write out all moves and counter moves. In the same way that in math N*2 writes out every possible even number.
@10680
"a lack of understandig for what a proof is" ++ I understand what a proof is.
It is not forbidden to think in proving something.
Use of game knowledge is beneficial in solving a game.
"It just require insanly much more computing power" ++ Solving chess is a huge task.
Therefore it is necessary to remove some hurdles, not invent new hurdles.
1 e4 e5 2 Ba6? needs no investigation, we know it loses for white.
1 a4 needs no investigation, it is unthinkable that 1 e4 cannot win and 1 a4 wins.
So if 1 e4 is proven a draw, then 1 a4 is a draw a fortiori.
Some opposite colored bishop endings and some rook endings are known to draw, like the 2 examples given. We can trust ICCF (grand)masters on this.
There is no need to burn computer power to prove the obvious.