Chess will never be solved, here's why

Sort:
Avatar of Optimissed

Silly people. ^ happy.png (like that!)

Avatar of MARattigan
tygxc wrote:

@7042

"the maximum number of moves in a legal game is about 5000 moves, (a quick google suggested 5899" ++ 5898.5 due to the 50-moves rule. https://wismuth.com/chess/longest-game.html However, from the initial position a 7-men endgame table base draw or a prior 3-fold repetition is reached long before 300 moves.

Didn't you mean long before 30 moves?

But it's not limited by the 50 move rule because claiming is optional. And in a practical game you don't claim as soon as it's reached if you have mating material anyway (or even if you don't in many cases). 

Avatar of Optimissed
Botlosenik wrote:
Optimissed wrote:
Botlosenik wrote:
Optimissed wrote:

Enough people can't help talking rubbish in this thread because the problems are actually quite hard to grasp with the mind. I was really just trying to encourage you to focus better. If you did, you'd be one of the few. Don't talk about silly stuff like infinite speed because no-one will understand the context if they don't read every post. There are enough people here who simply cannot grasp the problems, without others encouraging their lack of focus.

I thought I was being courteous by answering  your questions. Apparently this was a mistake, you answered this attempt with rudeness. I shall venture not to repeat this mistake in the future.

I could explain in detail how you were being rude, but having seen how you respond to courteous posts, and how you have also gone after others even in the short time I have been here, I am sure you would be all too happy to make that into a pissing contest that I do not wish to take part in.

Notice who gave you a thumbs up. There are too many people trying to get themselves taken seriously without advancing serious arguments. If you wrote something intelligent, I'd be on your side and supporting you. All you have to do is raise your game. If Morning Glory and MAR agree with you, isn't that a sign you're on the wrong track?

All I was doing is pointing out that your arguments are all jumbled up. You are hardly alone in that so don't take it to heart. Just learn from your mistakes, make better arguments and try to understand why you're being disagreed with, rather than going for the lowest common denominator, which is that I was being "rude", so you go on the attack. Are you a troll like Morning Glory and MAR?

Yea, like you have ever been on the side of anyone who has not knelt to your precious ego. I will block you for now. You have nothing to tell me, you have not said anything that was useful to me since I arrived, and you will not listen to what I have to say.


Your little friend is still liking your comments but let's be clear about this. Your comments aren't malicious but your ego is being prodded by your little friend, who's manipulating you, because HE sees YOU as an easy target.

It's ALL about YOUR precious ego. You're the one who made the naïve comment, got all upset, completely over-reacted and you won't let it go. You're the sort of poster that people are referring to when they mention popcorn. Your little friend is beyond redemption but you clearly have a lot to learn.

OK, carry on as you were! 

Avatar of MARattigan

Oh, do shut up. Nobody's interested.

Avatar of Optimissed
MARattigan wrote:

Oh, do shut up. Nobody's interested.

I know and if nobody's interested then they aren't going to mind my meaningless comment, are they. You seem VERY interested. You're nobody?? Because you're certainly interested.  

Avatar of Optimissed

Anyway why pick on me, you moron? happy.png

Avatar of MARattigan
Optimissed wrote:

Anyway why pick on me, you moron?

Because you're the one that keeps calling people morons.

Avatar of BoardMonkey

Such vitriol on this thread.

Avatar of Optimissed

It's all in their minds. They must be very bored.

Avatar of tygxc

@7032

"Didn't you mean long before 30 moves?"
++ The shortest transition with optimal play from both sides from the initial position to a 7-men endgame table base draw took 31 moves:
https://www.iccf.com/game?id=1164331 

Avatar of Optimissed

It appears to be highly relevant to your many, previous descriptions of how you would try to work towards a weak solution in five years, with cloud engines running stockfish and three GMs with cigarettes in long holders. Your belief that is possible, apart from ignoring the time constraints (five years is ludicrous) is based on your belief that Stockfish can evaluate positions accurately. It was obvious to the rest of us that it cannot do that and this example seems to back that right up. A solution needs to be accurate and you can achieve no accuracy with your methods.

Now you will wait for someone else to post or try to answer something you already answered from earlier, because you aren't honest, since you dodge arguments and you don't credit good arguments, since you can't even understand them.

Avatar of MARattigan
tygxc wrote:

@7032

"Didn't you mean long before 30 moves?"
++ The shortest transition with optimal play from both sides from the initial position to a 7-men endgame table base draw took 31 moves:
https://www.iccf.com/game?id=1164331 

Final position has 10 men. In which 7 man tablebase did they look up the draw?

Mine was faster anyway.

Avatar of mpaetz

     Even top GMs make mistakes and misjudgements. Today's analysts find errors in games from yesteryear that were considered brilliancies. So how can a group of GMs (smokers or not) be expected to recognize perfect play? How can we rely on their decisions as to which lines to ignore? 

     Top engines will beat any GM. Today's top engines will beat the top engines of five years ago. By the time this five-year "solution" process is complete it will be out of date. 

     There is no way Sveshnikov's plan will produce a definitive solution. There is no way that a brute force calculation of all possible lines, from the opening position to checkmate or a hopeless draw, can be accomplished within a reasonable period of time using today's technology, as has been repeatedly demonstrated here.

     The only possibility for solving chess I can see is a revolutionary "great leap forward" in data analysis technique or/and computing/storage technology. There is no reason to believe this will never be possible, although I hardly expect to live to witness such an outcome.

Avatar of Optimissed
mpaetz wrote:

     Even top GMs make mistakes and misjudgements. Today's analysts find errors in games from yesteryear that were considered brilliancies. So how can a group of GMs (smokers or not) be expected to recognize perfect play? How can we rely on their decisions as to which lines to ignore? 

     Top engines will beat any GM. Today's top engines will beat the top engines of five years ago. By the time this five-year "solution" process is complete it will be out of date. 

     There is no way Sveshnikov's plan will produce a definitive solution. There is no way that a brute force calculation of all possible lines, from the opening position to checkmate or a hopeless draw, can be accomplished within a reasonable period of time using today's technology, as has been repeatedly demonstrated here.

     The only possibility for solving chess I can see is a revolutionary "great leap forward" in data analysis technique or/and computing/storage technology. There is no reason to believe this will never be possible, although I hardly expect to live to witness such an outcome.


Tbh of course he's talking of a "weak solution", which is one backing up a general prognosis that chess is drawn by best play. It means that some pruning is possible, although the methodology is assumptive because it depends on the result being correct: that chess is drawn with best play. It's therefore incorrect methodology, since it boils down to pruning the methodology with a view to the expected result being right and in the unlikely event of chess being a forced win for black, it wouldn't be able to pick that up. Of course, we think we know that chess isn't a forced 0-1 but even so, the methodology means it isn't a proper solution.

Also it isn't fully comprehended that it's impossible to just follow the drawing solutions or lines, ignoring the rest. Since there's a big, fuzzy margin where we can't know if a line is drawing or winning for one side, there's a lot of excess "fluff" that has to be comprehensively analysed, since it may just be that there's a winning line hidden among it which isn't the result of an error in play by the losing side. We think we can believe that isn't so but to assume it isn't so is incorrect methodology. 

Avatar of gdChss

The longest chess game is around 6000 moves possible, isn't it? We have limited number of choices in total, not infinite. Game has to end in six thousand moves, one way or another.

So we have 32 pieces, finite number of possible moves. Computers can't compute and store all combinations? to a hard drive?

Then analyze all static positions and give everyone of them a positional value? It doesn't look impossible at least. Just need vast computation power and correct way to approach to the problem.

Avatar of Optimissed

Yes as I remember it's supposed to be 5800 moves. No, all the move permutations are too much to be stored pretty much anywhere. The computational power would be vaster than anything we can imagine at the moment.

Avatar of MARattigan

8848.5 moves long. But 5800 or 8848.5 moves long makes no practical difference. Either is impossibly long with current technology and ideas if the starting position is a draw. If it's a mate in 16 that's different.

(That's competition rules post 2017 of course. Under FIDE post 2017 basic rules or pre 2017 rules the longest game is infinite.) 

Avatar of MARattigan
DesperateKingWalk wrote:

Here is a video showing the longest game possible in chess. And the exact number of moves is  5898 moves. And the video also shows how this number was calculated. Pretty cool!

https://www.youtube.com/watch?v=D5DXJxR3Uig

That's the trouble with videos. It's not. It's 8848.5.

Read the link.

(They probably meant 5899 anyway, or 5898.5 at any rate, depending on how you look at it.)

Avatar of Lit
TheChessIntellectReturns wrote:

Imagine a chess position of X paradigms. 

Now, a chess computer rated 3000 solves that position. All well and good. 

Could another computer rated a zillion solve that position better than Rybka? 

No, because not even chess computer zillion could solve the Ruy Lopez better than a sad FIDE master could. 

the point is, there's chess positions with exact solutions. Either e4, or d4, or c4, etc. 

nothing in the world can change that. 

So if you are talking about chess as a competitive sport, then chess has already been solved by kasparov, heck, by capablanca. 

If you are talking chess as a meaningless sequence of algorithms, where solving chess equates not to logical solutions of positional and tactical prowess, but as 'how many chess positions could ensure from this one?'' type of solutions, then, the solutions are infinite. 

So can chess be solved? If it is as a competitive sport where one side must, win, then it has already been solved. Every possible BEST move in chess has been deduced long ago. 

If chess is a meaningless set of moves, with no goal in sight, then sure, chess will never be solved. 

 

absolute nonsense. chess is an abstract game and it is not infinite, really huge, but not infinite, it's possible that in the future chess will be solved by a computer using a smart algorithm. I think maybe one day computers prove that chess is a mate in 200 from the starting position. and the only very best move is e4 and not d4 or vice versa. but even after that day chess will stay a competitive sport and people start the game with different openings.

Avatar of MARattigan
NotAMasterButPrettySolid1 wrote:
...

absolute nonsense. chess is an abstract game and it is not infinite, ...

Depends on which rules you pick. Only finite under FIDE competition rules since 2017. Still infinite under FIDE basic rules and infinite under basic or competition rules prior to 2017.

Doesn't stop there being a solution.