Chess will never be solved, here's why

Sort:
tygxc

#3895

"I completely agree with btickler that tygxc has drastically underestimated the number"
++ So you do not understand the difference between weakly and strongly solving either.
10^44 is the number of legal positions for solving strongly.
Weakly solving requires far less, about 10^17.
Losing Chess has been weakly solved using 10^9 positions, not 10^44.

"produce a perfect chess engine which makes no mistakes"
++ No, that is not weakly solving.
Weakly solved means that for the initial position a strategy has been determined to achieve the game-theoretic value against any opposition.
'a strategy' ++ can be a proof tree or a set of rules or a combination of both
"the game-theoretic value" ++ a draw
"against any opposition" ++ white tries to win, black tries to draw, white fails, black succeeds

"points of imbalance and recrystallisation" ++ mumbo jumbo

tygxc

#3989

"I think that the terminology is complete nonsense" ++ I am sorry, that is the scientific terminology in the game theory field. I explained in layman's terms for your convenience.

"we disagree, therefore you do not understand" ++ People disagree because they do not understand. They should read and think before disagreeing. People are better at slinging insults and accusations than at reading and understanding.

"reading yours and btickler's correspondence with each other, it's apparent that you're talking past each other"  ++ btickler does not understand the difference between weakly and strongly solving, that is why about weakly solving he erroneously uses the number for strongly solving.

"the terminology, which is not fit for purpose. Its purpose should be to convey meaning."
++ The terminology is fit for purpose, it applies to any game, not just chess, but it is intended for scientific readers. That is why I have added an explanation in layman's terms and specific to chess for your convenience. 

DiogenesDue
Optimissed wrote:

Incidentally, this is not the province of game theory, so there's no need to follow their dopey definitions. It's much more digital intelligence. It's a computing problem. We're talking about using digital intelligence to analyse chess and that's just another problem in computing and software writing; not game theory.

I wouldn't criticise if it weren't so completely obvious the definitions are screwed up. I can think my way around them but if you start with the premise that the definitions are perfect, you're bound to become confused. It's quite comical watching you and btickler talking past each other and that's partly an effect of the confused definitions. If you want, I'll write a careful criticism of them. I don't know if it would help, though, because there aren't many people who seem to be able to understand that they aren't perfect. When I first saw them I thought they were some computing or philosophy professor's joke.

You've already written a criticism of the terms long ago.  It got the attention it deserved then, as well.  Take the hint.  Everyone gets that you don't like the nomenclature chosen.  It's not the greatest.  It is sound, however, and I am sure there is some evolutionary reason for the clumsiness of the terms for the average reader.

DiogenesDue
tygxc wrote:

btickler does not understand the difference between weakly and strongly solving, that is why about weakly solving he erroneously uses the number for strongly solving.

I just understand that all your shortcuts require determinations to reduce the 10^44 positions that are going to be roughly equivalent to just traversing the positions, say plus or minus a handful of orders of magnitude at best.

You don't seem to get this.  Your arbitrary reductions will require a massive amount of computation to apply your arbitrary criteria to each position simply to eliminate it from consideration.  Worse, at the end, your "good enough" shortcuts will produce a flawed answer that will not be accepted as a solution anyway.  Like building a house out of 2x4s and then staple-gunning cardboard for walls, then trying to sell it for a million dollars.

You can produce *something* in 5 years...but not a solution for chess.  More like a watered down attempt at a forward moving tablebase to meet the retrograde analysis in the middle.  The forward moving attempt will summarily eliminate valid positions in order to get around the fact that you are not working backwards from mate, which by force culls all of the invalid positions for you.  Not so for your ill-conceived plan.  What you propose would make engines stronger players, but the results would not even come close to being a solution for chess.

You don't have to believe me.  The proof is and will continue to be in the lack of anyone who knows how to build such systems paying the slightest attention to your plan.

cokezerochess22

I think the more I read this thread the more obvious the reason chess will never be solved is people cant even agree on what we want "solved" to mean XD.  Though I'm sure each and everyone can tell you exactly why how they feel about it is "the correct way".  The older I get the more "truth" seems to be as malleable as "morality". Fun thread to read though lots of nested philosophical ideas and such applicable to other arguments. When people cant even agree on operable definitions for the words used in the arguments you know its finna be a good time XD. 

DiogenesDue
cokezerochess22 wrote:

I think the more I read this thread the more obvious the reason chess will never be solved is people cant even agree on what we want "solved" to mean XD.  Though I'm sure each and everyone can tell you exactly why how they feel about it is "the correct way".  The older I get the more "truth" seems to be as malleable as "morality". Fun thread to read though lots of nested philosophical ideas and such applicable to other arguments. When people cant even agree on operable definitions for the words used in the arguments you know its finna be a good time XD. 

We need Speedtalk.

haiaku
Optimissed wrote:

People not anticipating Relativity cannot possibly have a bearing on this. Chess is a confined and fully known paradigm. It is only complexity which makes it difficult and not unknown elements.

What is that supposed to mean? The lines that no one has explored down to the tablebases yet, are unkown elements. You are excluding a priori that one, any one, of those lines may falsify the assumption that the game value is a draw.

There's no reason to assume there is one, That's due to the equalising tendency, which I've mentioned. It isn't going to happen.

"Equalising tendency" is too ambiguous. We could only say: 
1) S is a set of positions known to be draws;  
2) if both players play optimal moves from the inital position, it is possible to reach only positions belonging to S;
3) therefore, the initial position is a draw too. 
But then the question would be: how do we know that the positions in S are draws? How can we prove statement 2?

Optimissed wrote:
haiaku wrote:

Without a mathematical, exhaustive proof, a player cannot be guaranteed to be optimal, exactly like a scientific theory, without an exhaustive proof, cannot be guaranteed to always hold true.

You have to drop the deductive syllogism which runs as follows: [ . . . ] All analyses completed by SOFTWARE-WRITER-X are fully trustworthy.

Where do you read "computer-assisted" in my statement? The point is: how do you know that a statement holds true in any possible case, without an exhaustive proof that the statment holds true in any possible case? Because of a tendency? It would be inductive reasoning, overgeneralization. It is good for hypotheses, but not for conclusions.

you have no reason to believe that there will ever be a reliable proof. All analyses will be impossible to check. Even if you ran them twice, the same glitch could conceivably occur.

But that's exactly the argument you are trying to refute: conceiving the "unconceivable".

This means you are no nearer absolute knowledge than you are at the moment.

You and tygxc are about absolute knowledge. To me the only real proof is an exhaustive one, but it might be impossible to achieve that in practice, not only in case of computer-assisted proofs. If one million mathematicians do all agree that T is a theorem, they might all be mistaken. If we all see the sun rise, we might all be hallucinated.
Seriously, true scientists are skeptical in nature: they are aware that they can be biased and that what may seem universal can be in fact just a special case; it's already happened. What makes the difference between scientists and non-scientists is the level of accuracy, universality and stability of the conclusions, they seek. This make them use mathematical models of course, they try to falsify statements, they reproduce experiments, seek agreement with other scientists, etc.
A statement like "chess is a draw because of the equalizing tendency" really cannot be considered scientific, or nearly as reliable as a computer-assisted proof by exhaustion.

DiogenesDue
Optimissed wrote:

For example this. Arrogant nonsense written by a dimwit whose best years are well behind him. He ought to learn when to give it a rest but he thinks he's in charge.

The King of Projection speaks.

The fact that you can never seem to muster anything but crude insults tells the real story.  At every reply, I respond with civil discourse and observation, and you end up turning to one word insults, being unable to operate at the same level.  It's a tired refrain.

cokezerochess22

 "you think that's air your breathing right now?" Suffice to say I don't think we are gonna agree on what tasty wheat tastes like.  Whether we point to god or science as an authority people can still choose not to subscribe to either.  Still a fun thought experiment 

cokezerochess22

Sorry for what I didn't take offense to anything you have said?  I do think maybe its not worth either of your time with the back and forth can have some fun semantical debates without getting upset with one another I think. 

DiogenesDue
Optimissed wrote:

As for insults, everyone knows how you operate on your own threads. If anyone disagrees with you they are prodded into conformity. If that fails they are insulted. If that fails they are provoked into retaliation and then blocked. Because you do not have the ability to answer people's arguments. You always block them for insulting you, or so you pretend. You've done it to 100s of people with MY knowledge. So leave out the pretence. The insults ALWAYS start from you.

Maybe you need to read your own posts.  But of course, in Opti-land, saying that nobody in the thread is anywhere near your mental ability is just a statement of fact and not an insult to everybody here, right?  So when you review your behavior, it's all statements of "facts" by you about being superior, and ergo insults only come from other quarters.  Is that about the size of it?

You are the bull in the china shop.

Delusional thinking.  It's your defining characteristic.

Elroch

"IQ"?

Isn't that something kids get measured to give a hint of their potential to develop other skills that are more substantial than doing little puzzles?

Also something narcissists tend to exaggerate.

Elroch
Optimissed wrote:

<<<Solving chess means finding an optimal strategy for the game of chess, that is, one by which one of the players (White or Black) can always force a victory, or either can force a draw (see solved game). It also means more generally solving chess-like games (i.e. combinatorial games of perfect information), such as Capablanca chess and infinite chess. According to Zermelo's theorem, a determinable optimal strategy must exist for chess and chess-like games.>>>

The strategy for optimal chess consists of finding the best moves and that is all. If you can think of something better than finding the best moves, we'd love to know,

The quoted text is more substantial than the comment. It points out that there is a proof that an optimum strategy exists for games in a class including chess (I think the full description is finite, deterministic games of perfect information, all defined in texts. They left determinism implicit), and refers to the established name of the theorem. It also draws attention to the fact that there are three logical possibilities and what they are.

Note "perfect information" and "deterministic", as conventionally defined, are independent. While poker is neither, other games can be one but not the other. You could transform a game where the state was visible but the result of actions uncertain to one where the state was uncertain and the uncertain part of the state was what altered the effect of actions, so maybe they are being cleverer than me and realising you can do without the additional category.

TheNumberTwenty

What's amazing is that the 10^120 fact that everyone throws around doesn't even scratch the surface of every possible chess position... The famous 10^120 positions assumes a game that goes on for exactly 40 moves. Considering the fact that with the 50 moves draw rule the actual longest possible chess game is several thousand moves, you can only imagine how many orders of magnitude higher the actual number of chess positions are. Maybe something like 10^200 which is a number almost impossible to imagine

tygxc

#3922
"Maybe something like 10^200 which is a number almost impossible to imagine"
++ Please do not produce such nonsense.
It has been proven there are 10^44 legal chess positions
https://github.com/tromp/ChessPositionRanking

It is obvious the three sample positions make no sense.
A better estimate thus is 10^37
https://arxiv.org/pdf/2112.09386.pdf

The number needed to weakly solving chess is much smaller.
Losing Chess has been solved using 10^9 positions.
http://magma.maths.usyd.edu.au/~watkins/LOSING_CHESS/LCsolved.pdf 

tygxc

#3901
"rubbish" "they can't think straight" "completely dumb" "people of low ability"
++ Why if you are rated 2500 in debating you have to sling insults like a toddler?
"See how I put the definitions into plainer English."
++ Like a a translator with perfect conduct of English, but no clue about the subject. 
Why with IQ 170 you cannot appreciate that the definitions are carefully worded so as to apply to all cases? This is just hubris. This emeritus professor van den Herik is completely dumb, of low ability, cannot think straight and writes rubbish. I Optimissed will rewrite it so that it makes no sense whatsoever.
The same with chess being weakly solvable in 5 years. When Sveshnikov, grandmaster, 65+ world champion, author of books, professional chess analyst, MSc. Eng. near the end of his life says in an interview chess can be weakly solved in 5 years, you coud at least listen and think instead of outright dismissing it on no grounds at all.

stancco
Optimissed wrote:
TheNumberTwenty wrote:

What's amazing is that the 10^120 fact that everyone throws around doesn't even scratch the surface of every possible chess position... The famous 10^120 positions assumes a game that goes on for exactly 40 moves. Considering the fact that with the 50 moves draw rule the actual longest possible chess game is several thousand moves, you can only imagine how many orders of magnitude higher the actual number of chess positions are. Maybe something like 10^200 which is a number almost impossible to imagine.



To be fair, it's possible to work out the number of positions by simple arithmetic. That doesn't alter, dependant on the number of lines. It's the number of possible games which increases as the move numbers increase and not the positions, which is fixed.

Every possible position isn't relevant. Every relevant position or line is relevant

Exactly.

99.7% of all possible positions are not relevant.

tygxc

#3905

"I just understand that all your shortcuts require determinations to reduce the 10^44 positions "
++ No, there are no determinations needed at all. Only a tiny fraction of the 10^44 legal positions shows up during the solving process. Losing Chess has been weakly solved with only 10^9 positions not 10^44.
Look at the 3 sampled positions counted into the 10^44
https://github.com/tromp/ChessPositionRanking
It is clear that errors must have been made to reach those positions.

"Your arbitrary reductions will require a massive amount of computation to apply your arbitrary criteria to each position simply to eliminate it from consideration."
++ You still do not get it. I do not apply criteria and I do not need any computation to reduce positions, they just do not show up during the solution.

"More like a watered down attempt at a forward moving tablebase to meet the retrograde analysis in the middle." ++ That is how Checkers and Losing Chess have been weakly solved.
Have you read how they have done it?
http://magma.maths.usyd.edu.au/~watkins/LOSING_CHESS/LCsolved.pdf

https://www.cs.mcgill.ca/~dprecup/courses/AI/Materials/checkers_is_solved.pdf 
They did not start from the set of legal positions and then reduced that. They started from the initial position and then calculated towards the table base and at the end they had weakly solved it and then they counted they had visited 10^14 resp 10^9 positions in the process.

"you are not working backwards from mate" ++ I am not trying to strongly solve chess and compile a 32-men table base, that is not feasible.

tygxc

#3927

"99.7% of all possible positions are not relevant."
++ Only 10^17 positions of the 10^44 legal positions are relevant.
That is 1 position in 10^27 positions.
  0.0000000000000000000000001% of legal positions is relevant.
99.9999999999999999999999999% of legal positions is irrelevant.

renantepulma

Do you think. The confidence of 1/80 will do?  wink.pngwink.pnghappy.png