Chess will never be solved, here's why

Sort:
MARattigan
Elroch wrote:

@MARattigan, do you accept my point that we can ignore all positions where both sides have extra rooks or bishops?

With the way positions for black and white have dual use in a solution (i.e. a legal move that reaches a position that has already occurred in the analysis tree for the other side need not be analysed further) we need only deal with positions where "side B" has <=2 bishops and <=2 rooks.

That should save a useful amount on the Tromp number. Or at least what would be a useful number if a solution was close to feasible.

I wonder how much it saves?

Possibly. We can have an interesting discussion on exactly how unfeasible a forward searching solution is if we can manage to clear the thread of @tygxc's cut and pastes and @Optimissed's ramblings. I'll think about it, but a bit overloaded at the mo.

MEGACHE3SE
Elroch wrote:

@MARattigan, do you accept my point that we can ignore all positions where both sides have extra rooks or bishops?

ironically tygxc's whole thing about underpromotion isnt even something that couldnt be argued. hes just going for the whole wrong type of argument.

what needs to be done is to estimate (tbh make it an open assumption) that the number of positions with non queen promotions that would actually be relevant to be less than the number of the other total positions, using a confidence assumption drawn from master games.

because tygxc doesnt recognize the difference between a confident assumption and a rigorous logical maneuver, he doesnt have the ability to utilize the differences in what is to be at the end a CONFIDENT ESTIMATE of computing power.

unfortunately, what ive presented is an incomplete argument, due to a lack of transition to code execution, and theres a couple more confidence assumptions that need to be made (especially to deal with the fact that you MUST take underpromotions into account by at least one side in a weak solution). And im not going to waste effort and time on tygxc, but if yall want to i can right it out with more detail.

MEGACHE3SE
Optimissed wrote:

which seems not to be understood by people who are rather weirdly in my estimation keen on deductive reasoning. I tend to look at such people with a critical and sceptical eye. It should be possible to meet in the middle somewhere.

tygxc claims that what he is doing is deductive reasoning, and in addition a game solution is literally defined to be said deductive reasoning. I would not be hounding tygxc otherwise.

Prixaxelator

guys tell me why does london goes brrr

Elroch
Optimissed wrote:

<<<<"the 10^7 sample of master games"
++ Chess games are no random events, they follow logic, especially at higher levels.

You don't understand the notion of a sample of variation.>>>
Here it might be best to briefly explain what it is you feel isn't understood. What tygxc is saying, as indidated by "especially" is that there's a greater tendency at higher levels for chess games to be accurately played. It really is a communication problem. It takes two people to communicate.

His error is in thinking there is any conflict between the two. For example, imagine you play two super-engines (as consistently logical as you can get in chess) against each other for a million games . Like all real top engines, such as the latest Stockfish, I assume there is some random variation in their play.

This is enough to have very good statistical knowledge of the long run results you would get between the two engines. Suppose, for example, one of the engines wins 1000 games and the other wins 1000. You have a good estimate of the win rate of each engine (around 0.1%).

You also now know that if you sample 100 games between these engines, you can expect to usually see 100 draws roughly 80% of the time. (Exact number can be calculated)

Under 20% of the time you will see 99 draws. About 4% of the time 98. And so on

Hopefully the stochastic nature of the results and the appropriateness of treating them as such is clear (it is the basis of all use of Elo type rating systems, and others).

"You are arguing for making an entire class of legal moves illegal" ++ No, I am arguing that the game stays the same if underpromotions to pieces not previously captured were illegal.

A claim which definitely can't be justified. You are appalling at reasoning logically.

Again, rather than respond like this, perhaps explain the exact context. I commented on this and explained why in my opinion tygxc's assumption is prone to inaccuracy by pointing out a situation where it would be inaccurate.

I have explained how ignoring the possibility of underpromotion (or inappropriately large classes of underpromotion) could sometimes makes a generated weak solution strategy fail. 

Specifically, suppose @tygxc's suggested algorithm reaches a position where underpromotion to an extra rook is the only way for black to win. His algorithm literally can't see that the underpromotion exists - it's effectively illegal - and says "this position is fine for white, giving a draw". The strategy is invalid and this is indetectible to the algorithm (because it does not know about the possibility of underpromotion in that position).

It's worth pointing out that this situation is very rare, but it seems totally impractical to prove that it is never relevant. If someone can do that, I will buy them a beer!

Your request for clarification was valid and appropriate. Thanks.

iqraniazi

"Explore a compelling list of 15+ genetically modified vegetables, delving into their role in modern agriculture. Discover how these innovations are shaping the food industry, sparking discussions on sustainability and the future of farming practices. Join us as we unravel the complexities and potentials of these man-made wonders!"

For details visit:

DiogenesDue
tygxc wrote:

"it is a sample of 3" ++ All positions counted by Tromp look like that.
Most have 9 promotions to pieces not previously captured.
99.95% have 3 to 16 promotions to pieces not previously captured.

"I was for a few months the highest rated daily chess player on chess.com."
++ chess.com daily is a joke. One may think for a day and the opponent for a minute.
One may play one game and the opponent 100 games simultaneously.

"No engines, no tablebases" ++ Impossible to verify.

"very unusual things happen occasionally" ++ Chess is a very logical game.

"As many master games show."
++ Show one real master game with an underpromotion to a piece not previously captured.
Not a Nakamure trolling blitz game with 6 knights, not the Lasker trap.

"If that happens once in less than 10^7 games, that might happen 10^10 times in 10^17 games" ++ But a rare exception should not change the total count.

"in an enormous sample"
++ It is no random event, there is an iner logic resulting from the Laws of Chess.
A pawn needs time to reach the back rank, and in that time pieces get exchanged,
therefore promotion to a piece not previously captured is rare.
An average Tromp position has 9 promotions to pieces not previously captured.

The most reasonable piece to promote to is a queen.
Promotion to a knight is rare, but happens sometimes for the unique properties of the knight. Promotion to a rook or even bishop is even more rare,
and only happens to avoid a draw by stalemate.

Underpromotion to a piece not previously captured is the product of two rare events that does not occur in master games, not because the sample is tiny, but because of the inner mechanics of Chess.

That is why 10^38 is more reasonable than 10^44.

Even the 10^37 is too many: here is a legal position as counted in the 10^37, but which cannot be reached by reasonable play, let alone optimal play by both sides:

So daily chess is a joke to you, but 5 days/move is proven perfect chess....I see your unique brand of "logic" is functioning on all cylinders as per usual.

DiogenesDue
Optimissed wrote:

2398 is very good if you achieved it here. Well done.

My peak was 2225, both here and the same on Chess World. I found that I would have had to put a lot more time into it to get higher, like you by limiting it to a couple of game maximum, at a time and being willing to analyse for several hours per week. I wasn't willing to do that.

I found, at the time, that playing Daily chess here had a very positive effect on my otb play at classical speeds. In this incarnation I maxed at 2125 because I was less willing to put in time and effort than before and I had thought I had noticed that it was adversely affecting my performance in classical. I didn't play at all here for about a year except Chess960 and then after a break of a few months, played over 6000 5 mins blitz games over a year and a half. That was very beneficial for my return to otb chess and I won a rapidplay with 5/5 and have an otb rapidplay grade once again. ECF seems to have lost my last grade and details even though my last rated game was only 5 years ago.

I completely get where you are regarding tygxc but I also feel I understand him and that he's making a good point, but in his own way, which seems not to be understood by people who are rather weirdly in my estimation keen on deductive reasoning. I tend to look at such people with a critical and sceptical eye. It should be possible to meet in the middle somewhere.

You can't "meet in the middle" on solving a game. You either meet the criteria for a solution, or you don't. Tygxc does not, which should go without saying at this point, yet...

DiogenesDue
Optimissed wrote:

I'm aware you don't know the meaning of the word "compromise but this conversation is not for you. I find it difficult enough to find people who have some kind of idea of reality as it is without you wanting to join in.

Either read what I'm saying, understand it and understand what I'm doing, which you cannot manage, or don't expect your comments to be taken seriously. Various layers of interaction go on and leave you as an uncomprehending bystander.

Again, there's no "compromise" on weakly solving chess. This isn't a matter of opinion. The fact that you are promoting this just shows why nobody, on either side, listens to you here. Uncomprehending, indeed. By any definition that means anything, this conversation is not for *you*.

Elroch

In some areas compromise can be a good thing. On questions of objective truth, it never is!

Elroch

Objective truth does exist in the mathematical sciences. And that is especially inarguable in finite mathematics. Solving chess is a finite combinatorial problem, falling within this realm (not a very interesting problem to mathematics - rather like an arbitrary arithmetic problem of no special significance!)

Solving chess would provide unambiguous, absolute truth, but fudging a solution of it would give a conclusion that is not 100% certain.

DiogenesDue
Optimissed wrote:

One person at a time pls. Also, I'd prefer to talk to someone who is more my intellectual equal than you are, thanks.

I'm replying there to your reply *to me*, Sherlock. So, you need to admonish yourself by your logic...and please don't insult Elroch that way. Thanks for admitting you are not my intellectual equal, though...much appreciated, and surprisingly insightful compared to your usual fare.

DiogenesDue
Optimissed wrote:

Watson.

When you think of the good rejoinder only after the fact, you can always edit your post...you know, to attempt to look clever.

DiogenesDue
Optimissed wrote:

I don't need to. You do. I know you were full of incandescent rage and fury because Elroch and I were talking about something and you felt left out. He's all yours again.

Yes, you can really tell what a rage I must be in am in by my irate manner and lowbrow vocabulary...oh wait, that's all in your imagination.

DiogenesDue
Optimissed wrote:

Dioinnnnng.

And now we've reached kindergarten level retorts...regression, even for you.

playerafar

Optimissed will always pretend that his trolling is about whoever else.
Whether its a particular individual - or groups of people.
On occasion some persons actually fall for that crass illogic of Optimissed's.
But most don't.
Usually - whatever Optimissed is claiming or asserting - its the reverse that is the reality. Constantly. Year in year out.

playerafar

What is tygxc's motivation to make exaggerated claims?
Is it this?
From GM Evgeny Sveshnikov:
' "He described his general understanding of the game in the following, also very strong statement:

"Chess is an exact mathematical problem. The solution comes from two sides: the opening and the endgame. The middlegame does not exist. The middlegame is a well-studied opening. An opening should result in an endgame.... Give me five years, good assistants and modern computers, and I will trace all variations from the opening towards tablebases and 'close' chess. I feel that power."
Sveshnikov 'feels power' so it must be so? 
------------------------------------
Pasted from here: https://www.chess.com/news/view/evgeny-sveshnikov-1950-2021which in turn is from here:
https://e3e5.com/article.php?id=1467But that's in Russian.
And its Amazing how easy it was to translate that into English.
I didn't have to copy paste. And I didn't even have to click 'Select all' either (not sure that option was there anyway)
Just Right click and scroll down a bit in the right click options.
and click 'Translate into English'
and the whole page morphs into English.

Kyobir

never say never

tygxc

@14104

"daily chess is a joke to you"
++ chess.com daily without engines, not competitive, played by weak players is a joke

"but 5 days/move is proven perfect chess"
++ ICCF World Championship Finals very competitive to become the World Champion played by ICCF (grand)masters who qualified through Preliminaries, Semifinals, Candidates and with twin engines each 90 million positions/s produces 113 draws out of 113 games and is thus 99.992% sure to be perfect chess with optimal play by both sides.

tygxc

@14092

"It's about targeting quality not quantity"
++ If you play only 2 games simultaneously and your opponent plays 200 then it is easy. Amateurs occasionally beat grandmasters in simultaneous exhibitions.

"you yourself rely on a tiny sample" ++ No. It is no sample, it are all 113 games ending in draws. So the probability of an error is < 1/114 and the games are > 99.992% certain to be perfect games with optimal play from both sides.

"They stopped being correspondence chess and became centaur chess" ++ Correspondence chess turned into centaur chess and ICCF rightly decided they could not detect the difference.

"Yes, it does."
++ Show a master game with an underpromotion to a piece not previously captured.

"You are talking about solving a different game." ++ No. I observe that the weak solution to the different game is the same as the solution to Chess. So for counting the number of positions relevant to weakly solving Chess I can count for the different game.

"underpromotion to rook or bishop is also necessary for proving chess is a draw"
++ But underpromotion to a piece not previously captured does not happen.

"you CAN ignore positions that have extra rooks and bishops for BOTH sides"
++ Finally you get it. All 3 random samples Tromp displays are such.

"you can't exclude multiple additional rooks and bishops for one side"
++ It does not happen in master games representative for reasonable play and it does not happen in ICCF draws representative for perfect play. If you disagree, then show a master game with underpromotion to a piece not previously captured.

"you only need one" ++ Schaeffer needed 10^14 for Checkers.
Chess needs 1.8*10^17 = Sqrt (3*10^37 * 10.9456 / 10,000)