When do you think chess will be solved?

if it is solved it will ruin the game for me....time to find another pastime after that....

.. You'll probably, find this 'link' interesting, 'Ann'.. if you haven't already read it {!?}

https://qz.com/906447/artificial-intelligence-has-brought-doubt-and-suspicion-to-the-ancient-world-of-shogi-or-japanese-chess/

But then if it rains, wouldn't all of the answers fall out of the cloud?

I don't think it will ever be solved. Each person is unique in their own way. The solution to chess will have to be a solution to all the games EVER and ANY possible opponent. Not everyone will play the best move - since not everyone will see it. And how would this solution work against someone who doesn't know anything about chess, except how the pieces move?
There are just too many things to take into account - leading me to the conclusion that there won't ever be a solution.

That being said, erzangel's answer seems accurate!

.. Before, 'chess' in its' entirety, is solved - They'll 1st need to 'solve' the 'Byrd's Opening' - 'Paris- Gambit'.. Where, after, 1. 'f4'.. White, proceeds, to fianchetto, his, or her, 'king-side', 'bishop'.. with,  2. 'g3'.. followed, at some, early 'opening' move, by 'white' playing, Ng - h3 !?

.. I played this, opening, within, the last 90 minutes, {twice}.. In my 1st game, I prevailed over, a 'higher- rated' player.. And, in my 2nd game, I got 'mated'.. On around, my 15th move !?  ] ;

There's a difference between saying chess is "solved" and saying the "perfect game" has been determined. Eventually, computers will be able to calculate completely enough to determine every possibility and decide whether White wins due to the first move or if, as likely, the perfect game.

But just as some played play 1 b4 to shock a low ranked opponent and outplay him based on better knowledge of opening principles and tactics, if someone memorized the moves to the perfect game it's more than a billion to one odds that both sides with play the moves!

In fact, to make sure GM's don't prearrange draws against each other, playing the perfect game past x-number of moves will probably be banned!

Let's!

I just solved it but - im sorry for you guys - the file is too big to be uploaded on this site  Perhaps i will share it when they expand the servers...

Nice one GMVillads! 

When the sun turns into a white dwarf, ok, no more astronomy.

   ---   Yes indeed ! A huge fountain of optimism   lol.

Endgame tablebases already exist for around 7 pieces on the board. Even if we get up to 10 pieces, it becomes apparent we'll run unrealistic database storage requirements. But something more practical is that if a chess engine were designed and only ran specifically on boards with 6 or less pieces, and validated against a tablebase, then we overcome the requirement to have terrabytes of storage in order to play a perfect endgame with 6 pieces on the board. The next challenge then becomes creating an engine specific for handling 7 pieces before switching to the engine that plays 6 pieces perfectly. Once the 7 piece engine play perfectly relying on the 6 piece engine, then we can work on an 8 piece engine until ultimately we have an engine that tells us the result of the first move in chess.

I predict within the next 20 years for sure.

I don't think it will ever be solved. The engines get faster and stronger and will eventually be able to see that it is a draw with perfect play, moving first isn,t a big enough advantage in this sport to force a win. This is just my opinion of course but it is what I would answer if asked the title of this thread.

I agree that chess engines keep getting stronger and faster, but validating they are playing perfect chess is tricky due to the alpha–beta pruning approach used in chess engines.  Unless we can validate they are playing perfect chess, we'll never know for sure the result of the first move because they might have pruned a candidate move that would have been the best move in a particular position. But I think chess engines will reach a stage where they peak, playing perfect chess, and draw each other 100% of the time. Then the next challenge in computer chess would be playing seemingly perfect chess, as far as the other engines can tell, with the least resources and fastest move calculation.

There are already numerous threads on this subject, and one or two of them are over 100 pages.  There's nothing new to be added here.

Solving chess isn't necessarily about the final outcome.

Finding the optimal strategy might be a perfectly attainable goal sooner than later.

A much needed heuristic endowment to engines (probably a different computation paradigm) could speed things up dramatically.

Maybe you can share the thread names?

..D-u-h ?! .. It involves, typing in, the pertinent question, on 'Google', search?!

.. One, of many 'links'.

https://www.quora.com/When-will-chess-be-completely-solved

every mathematician and chess player will disagree with me but I believe it is already solved - like fifty kabillion permutations and combinations BUT - (bearing in mind I only got 60 percent average in high school and college this is my humble opinion ) - BUT at the start only the middle two pawns or one of the two knights will probably be moved ) that eliminates 1 kabillion permutations and combinations - then both players will try to get all the power pieces into the middle to maximize the squares the pieces can control or threaten ( that eliminates another 2 kabillion permutations and combinations - then now in the middle game - half of the kamakazi pieces were kilt - leaving about half the pieces remaining - that elimates another 1 or 2 kabillion permutations and combinations - then with the remaining pieces - there are another 1 or 2 kabillion permutations eliminated because on looking at any middle game THE NUMBER OF STUPID SQUARES TO OCCUPY VASTLY OUTNUMBER the good logical possible squares that have to be considered as possible good squares to move to - then finally in the end game another kabillion permutations and combinations are eliminated simply because you generally left with one six man seal team battling an enemy team of possible similar number - so few pieces left at the end game means at that point THERE IS NO LONGER a kabillion possible moves possible - - I think and believe that at this point in time - chess masters have already solved chess to a practical extent ( provided they are not put up against a super chess computer ) - - - I think and believe Bobby Fischer was a walking chess engine - and he for sure solved chess - and got bored of the game - hence making that " swear word swear word swear word chess 96o or whatever it is called - as for a rebuttal - I do not care - I believe every math guy and chess guy will disagree with what I just wrote - bottom line - I believe that bobby fischer and guys and girls as good as him already for all practical purposes SOLVED CHESS -  to the extent that humans can - I also believe there will never be another Robert Fischer - I believe he had a chess engine between his ears where other normal people have a brain ==== when people talk about the fifty kabillion combination I smile because it reminds me of that futurama episode where two robots are playing chess - and one says something to the effect THAT I HAVE CHECKMATE IN FIFTY KABILLION MOVES - and then the other robot says something to the effect OH RATS I LOST AGAIN

Solving chess doesn't mean finding the perfect game, it means finding the perfect move in each possible chess position. So if your playing with a computer program that knows the solution to chess, if you don't do a perfect move, that means that the computer will win the game.