"we just can't say for sure yet ALL of those undiscovered positions can't be forced from the opening position." ++ GM and ICCF and TCEC games rarely last over 40 moves. The 50-moves rule is almost never invoked before 7 men are reached.
[and]
99% of the ICCF World Championship drawn games are perfect games with no error from either side.
TCEC games average out to more like 60 moves as I recall when last I checked, and many go over a hundred moves.
You cannot determine a perfect game without solving chess, and saying that engines play perfect games because the same or other engines cannot discern any errors in those games is a form of circular logic you ought to understand, but apparently do not.
#3766
"I'm talking about solving chess." ++ Me too. The closest we have to that are ICCF World Championship games, TCEC engine games, and human grandmaster games. If most of these were draws by the 50-moves rule, then it would be plausible that there might be wins without the 50-moves rule, but that is not the case: the 50 moves rule is rarely invoked before 7 men are reached. When two intelligent entities human, engine, or centaur play, then their games usually end before move 50. The rules of the game are such that good play automatically demands pawn moves or captures.
"If there was a solution to chess in less than 50 moves, I think someone would have found it by now." ++ Chess is a draw. It is harder to prove a draw than to prove a win. Losing Chess (64 squares, 32 men, 6 kinds of men, just like chess) is a forced win and needed only 10^9 positions. Checkers is a simpler game (32 squares, 24 men, 2 kinds of men) but needed 10^14 positions. We already have part of the solution: 99% of the ICCF World Championship drawn games are perfect games with no error from either side. However 1000 perfect games are not a full solution.