I have written a Program in C# to solve chess puzzles. I'm currently going through the the paper back book "The Puzzle King , Sam Loyd's Chess Problems and Selected Mathematical Puzzles", Edited by Sid Pickard. Pickard & Son, Publishers. I'm looking to find one chess puzzle that this program can not solve with mate under 6 moves. Maybe in another 1000 years computers will be able to solve white to mate black starting from the chess pieces in original positions on the chessboard.
When do you think chess will be solved?
The number of possible positions is a red herring, there will never be a need to check all of them. It's more likely that an engine will find a forced draw for either side after twenty moves or so and that will be the end of the debate. Mind you that's still a lot of moves to check and won't be happening soon.
There are known wins that require more than 500 moves to force - and that's from 7 pieces on the board. The idea that a forced draw in 20 moves will be found is implausible; indeed, if a 20 move forced draw or win were there, we would probably already have found it.
.. Undoubtedly, more noteworthy, than the future timeline, when 'chess
will be solved'; Is the prospect, that once 'quantum computers' become commercially viable ..
{even if, it may take several shortened, quantum computer, generations} ; The time-gap in
machines achieving supremacy, in Any competitive endeavor, {even, robotic soccer}; Will become
ridiculously short, by today's standards ; And those 'games' where humans are better, than their
machine counterparts, will be in the minority. o: