Chess will never be solved, here's why

Sort:
MARattigan
Optimissed wrote:
...

Everyone pretty much gets Covid again and again, whether or not they are vaccinated. ...

I've had my shots and never had Covid at all.

You're very good at making statements about everyone based on nothing but your unfeasibly large IQ.

MARattigan
Optimissed wrote:
MARattigan wrote:
playerafar wrote:

@MARattigan
spotted your latest diagrams - but i think you missed my point about 'obvious positions'.
Because you displayed a position with a lot of bishops moving on the same color squares.
I'll read back some more - but the point isn't about such types of positions.
Its about lopsided material advantage where the other side has no stalemate or other draw refuge like perpetual check or other counter-play to rescue the position.
This idea of computer-solving projects (not Stockfish not Komodo) skipping such positions - hasn't really been discussed in the forum yet.
But how much interest can there be in any forum ?
The people doing the tablebase projects have an obvious 'interest'.
Its called a paycheck.

So what is your suggested algorithm for not discounting the Bláthy diagram?

He's learning from me and has finally realised that actually, money (and power) can be an incentive. He may have learned it from my arguments against drawing the wrong conclusion from the IOC classifying chess as a sport. I wonder if the two of you think you're contributing much with this interminable discussion between yourselves. Naturally, we all stand in awe of you.

Obviously that is an outstanding contribution to the discussion @Optimissed. Well done.

playerafar

@MARattigan
(O is inept about paradox in IQ and credentials and money and power - and most of everything he says is a reverse of the realities)
-----------------
But regarding our recent discussion between you and I about what computer projects should could or would skip:
A little joke is in order:
Francois Philidor (the Isaac Newton of chess?) is showing a beginner how to mate a lone king with rook and king.
The beginner catches on fast. Masters it. Philidor is pleased. Congratulates his student.
But then the student asks:
"But monsieur ... what if the winning side had three rooks instead of just one?"
Philidor tries to conceal his frown and then grin. Keeps a poker face.
Wonders to himself 'if he was going to ask about that - why didn't he ask about two rooks first? instead of three - and should I mention?'
Decides no.
Philidor: 'Lets have some wine first. You like Beujolais?'
After lots of wine 'Phil' says: 'We'll look at 4 rooks first.'

playerafar

You didn't prove anything Dubro.
I'm predicting that O will be 'stroking' you and you'll keep falling for it and therefore keep insulting Elroch and MARattigan.
Something like what C-Rat (ibrust) kept doing - and got muted for.
---------------------------
time to see what Grok says about 'skipping superflous positions' in chess-solving.

Elroch

@Dubrovnik-1950, you are exhibiting obsessive repetitious behaviour. I have to point out it gives the impression of dull-wittedness.

Of course, the combination of arrogance and apparent lack of understanding of pretty much any intelligent post (based on the responses) reinforces this impression.

MARattigan
Dubrovnik-1950 wrote:
Elroch wrote:
Dubrovnik-1950 wrote:

And we are still waiting for you to REFUTE any of this from Grok, or myself.

But you can't......You no nothing but bad time stories. And not what is needed. Knowledge of chess, computer chess, and game theory.

Fairytale time is OVER!

You don't understand enough to see when Grok gets it wrong, and you (inappropriately) worship its infallibility so are blind to intelligent input from people who know more than you.

I have to point out that spouting mantras every time your errors are mentioned is not the behaviour of an intelligent person, but you seem to have already given up any claim to that by deferring the infinite wisdom of an imperfect tool instead.

I know all of this..... And I do not need Grok.

But Grok makes it much more fun....

We're aware that you can get it wrong without Grok's help. You've fully demonstrated that.

You might find getting it wrong with Grok more fun, but are you aware that the rest of us don't find you getting it wrong with Grok more fun? Some of us find it very tedious in fact.

Elroch
Dubrovnik-1950 wrote:
Elroch wrote:
MARattigan wrote:
Dubrovnik-1950 wrote:

That refuted nothing.

All you can do is tell fairytales.

You can not even get the tygxc information right without lying.

tygxc said chess could be weakly solved in 5 years many times, and that started 3 years ago moron.

But not with Schaeffer's procedure O highly intelligent being.

Yes. @tygxc was more saying that it would be possible by five years of effort to become more convinced about the answer we already believe, without getting anywhere near a true solution. He obfuscated this by obstinately misusing the term "solve".

[abuse deleted]

Firstly, note that personal abuse is against chess.com rules. It's about time to start reporting every instance of this that comes from you. Also any more spamming.

Secondly, I am going to explain this very slowly and carefully, since it is directed at you rather than someone with strong relevant skills.

The quote you posted from @tygxc exemplifies his misuse of the word "solve" exactly as I explained. He described a procedure in other posts which involved a combination of grandmaster judgement and non-comprehensive engine analysis to get confident estimates of the true evaluation of reasonable opening lines, like a souped up version of the way GMs might analyse a variation in their preparation. This is not solving chess, but it is what he calls solving chess. Obviously a few current machines for 5 years would be woefully inadequate to really solve chess.

I suspect that even with an explanation you won't understand that and will be away with the fairies again.

playerafar

Dubro is free from the error of 'trying to win a popularity contest' ...
but not free of the error of 'deliberately trying to win an unpopularity contest'
---------------------
Dubro you can win that second one by accident you know. Maybe.
happy

playerafar
Dubrovnik-1950 wrote:

You sound pissed off......Hmmmm

In your dreams.

MARattigan
Elroch wrote:

Stockfish evaluates this position as +13.6 for white. Should be enough, surely? (Chess.com analysis doesn't correct it, but uses some heuristic to conclude what the value is).

It doesn't matter for practical chess.

 

@playerafar mentioned excluding all bishops and immediate stalemates. This should be a better example at -14.4

White to play
 

So, @playerafar, what is your algorithm for disposing of that one?

DiogenesDue

Looks like someone is taking a vacation, quite a few pages worth.

MARattigan

Not unexpected. I think it's @Grok3.

Elroch
MARattigan wrote:
Elroch wrote:

Stockfish evaluates this position as +13.6 for white. Should be enough, surely? (Chess.com analysis doesn't correct it, but uses some heuristic to conclude what the value is).

It doesn't matter for practical chess.

 

@playerafar mentioned excluding all bishops and immediate stalemates. This should be a better example at -14.4

I meant that 13.6 pawns should be enough to win. grin.png

So, @playerafar, what is your algorithm for disposing of that one?

There's the problem. There are so many "special" positions that a set of exclusion criteria will never be enough.

Nice position. Took me a while to realise black can't stop white saving it (duh).

MARattigan
Elroch wrote:

@MARattigan, wouldn't you agree that saying "a fundamentally different strategy" to solve chess is much like saying "we need faster than light drive to travel around the galaxy"?

. the truth is that there is almost certainly no such strategy that will take us a large fraction of the way to a solution being possible (on a log scale). Rather the large majority of what we need is an increase in computatational resources, whatever method is used.

When comparing here, I am thinking on a log scale. Say we need 10^15 more computing power (not a precise number), we might pull that down by a factor of, say, 10^2 with brilliant advances in strategy, but the large majority of the gap remains (on a log scale).

No. I wouldn't agree.

Consider the following two player game.

At the start of the game the index is set to 3.

White moves first and chooses a positive natural number.

If in a set prearranged time Black can find another positive natural number such that when the two numbers are raised to the index and added the result is some other natural number raised to the same index he wins.

Otherwise the index is increased by 1 and Black moves next with the roles reversed.

Thereafter the players alternate moves, the index increasing by 1 each time.

It was suspected for a long time that the game was drawn and some results were established such as, like chess, the game could not be won on the first move. But relatively recently the game was completely solved as drawn.

Note that the game tree, game states and branching factor are all infinite.

But the solution was not found by a BFI routine run on a computer. It was, in fact, a fundamentally different strategy.

I think if chess is ever solved the same will probably be true.

Edit: Now I think about it, it is trivial to prove the game I outlined is drawn, but still by a fundamentally different strategy.

MEGACHE3SE
MARattigan wrote:

Ah! If only you could read! Nobody on the thread has ever suggested that a solution of chess along the lines of the checkers solution would complete in the foreseeable future. Not even @tygxc

came to this thread cuz i got a notif that opti got muted again, got jumpscared when i saw yall talking about tygxc lol.

but i do want to correct this, @tygxc's claim of the 5 year 'solution' is actually explicitly based on that method/solution for checkers. Yall mightve forgotten and have accidentally sanewashed him, but no, that was literally what tygxc was claiming. he just straight up assumed that not only was the chess engine involved going to be perfect, but that it would be perfect with only 1 node of computational power allocated per position.

tygxc never said ' that it would be possible by five years of effort to become more convinced about the answer we already believe, without getting anywhere near a true solution. He obfuscated this by obstinately misusing the term "solve"'

tygxc genuinely claimed that his methods (like discarding positions without actually looking at them, having enough strong engines reaching draws) were a rigorous logical proof.

ex: in response to "It's safe to say chess still can't be rigorously solved."
++ No, on the contrary it is safe to say chess can be rigourously weakly solved.The 17 ICCF WC Finalist and their servers are doing it now.110 games out of 110 that redundantly link the initial position in average 39 moves to certain draws. - Tygxc.

MARattigan

Yes. It's subtle difference.

@tygxc claimed that his proposed "solution" would complete in the foreseeable future and he also claimed that his proposed "solution" was along the lines of the checkers solution. Both were false. My meaning was that he had never claimed that a solution that was actually along the lines of the checkers solution would complete in the foreseeable future (only his own, which was not).

playerafar

@MARattigan - I don't think you got the points I made.
For one - many bishops moving on the same color squares - not 'all bishops'.
For two - that isn't talking about 'won' positions.
For three - I didn't say 'all bishops'.
------------------------------
I haven't taken the time yet to read over all recent posts by worthy posters such as yourself Martin and Elroch and Dio.
------------------------------
But I did have some conversation with Grok just now about 'alternative solutions of chess'.
Various points were covered. Thousands of words 
Obviously I'm not going to do a 'Dubro' and kneejerk the entire conversations with Grok.
But there are salient points.
---------------------------------
First I had to get the concept across to Grok about tablebase endgame projects that concentrate on adding to won positions already established by Syzygy ...
then I had to get it to understand that this would not be done by retrograde move additions.
And I added that that would be hopeless in the way 'game tree' from the front already is.
No gametree analysis.
Not necessary. Once a position is established as a win because of lopsided material advantage - and you add any piece to the winning side - you only have to do another stalemate check and perhaps a couple of other relatively very minor checks like making sure an addition of a piece doesn't make winning impossible.
Which is extremely unlikely against lone king.
----------------------
then I started asking questions about a ratio of lopsided material wins to minimal wins (not book wins) ... and has anything been published about this?
Grok and I agreed that chessplayers and mathematicians would have considered such things both before and after the development of computers - and Grok mentioned about 'alternative solvings' of chess ... And I had to make it clear to Grok I was asking about published theories not 'published alternative solvings' whic hof course don't exist anyway.
As in not yet.
---------------
Grok mentioned Moore's law and 'Haworth's law' (which isn't a law)
The point is there's apparently been no formal work done on computer projects to solve positions by adding material to won positions that are wins because of lopsided material advantage. Nor has there been formal published theory on that either.
As in - not anything that Grok found when I asked it.
-----------------
Grok liked the idea - and gushed. But it often does. The idea is to ignore that.
Grok - like Chatgpt and Copilot is built with an idea that it must err on the opposite side of cricizing its users.

playerafar

Hi MEGA 
you got here just in time to miss Dubrovnik getting muted for the kind of thing that Opto has been doing for years.
And 'crazyrat' (who has two C-Rat accounts and is also an ibrust account and does O-worship) getting muted although he's back from that mute.
----------------------------
Conjecture about the number and ratio of lopsided material wins within John Tromp's number.
A legitimate way to cut it down.
John Tromp's number is a big cutdown from 13^64 and from the even bigger Shannon number.
But part of future solving might involve a process of further legitimate cutdowns.

MARattigan
playerafar wrote:

@MARattigan - I don't think you got the points
For one - many bishops moving on the same color squares -
For two - that isn't talking about 'won' positions.
For three - I didn't say 'all bishops'.

I think maybe you're missing the point.

You're proposing not to investigate won positions with a large discrepency in material on the grounds that they're won. The gaping flaw is - how do you know they're won without first solving?

Of course I can give you lots of examples of positions with large discrepency in material that are won and fit in with your "For two", but the whole point of the example is that it isn't a win.

And the Bláthy example has only one bishop.

What algorithm would you propose to avoid assigning a value of winning to general positions with large discrepency in material that are not winning. How are you going to recognise the exceptions? Stockfish won't reliably tell you.

playerafar

MAR - you're still missing the main points.
Are you suggesting that doing a stalemate check is harder than solving a position?
Your Blathy example is of something not applying to my suggestion.
Why would you want to include positions that add to a-apawn endgame draws?
Martin's a good man though. (tempted to make a pun based on Swiss Family Robinson and Swisss Army knife but that got cancelled before Season 1.)
Yes - Martin's a good man. I do mean that.
-------------
Martin did you see my Philidor joke?
Lets try an even shorter version of it.
GM instructs E player how to checkmate with K+R versus K ...
'E' masters it fast - but then asks 'what about three rooks'?