Chess will never be solved, here's why

First sentence is b*llocks if you're talking about chess.com chess. No 7 man tablebase covers any positions that include previous repetitions with the same material under the 3R rule or castling rights. And the 8 man positions we have don't necessarily work in chess.com chess.

@Optimissed as usual not even on the same planet.

But they'll never accomodate repetitions (admittedly not relevant to a weak solution of "chess" as a whole). And don't hold your breath till we get 8 man tablebases that are guaranteed to work in chess.com.

@Optimissed

Have to admit I'm a bit weak on Theory.

If the game state never did change, they'd never reach either mate.

No. The game theoretic value was a win and remained a win. The game state changed with every move.

So far you've confused game state with both game theoretic value and nodes reported by an engine.

@Elroch

Don't blame it on the long day. You've never been able to say anything sensible at any time.

Again. Every move changes the game state whether it's perfect or not. The possible continuations change.

Perfect moves leave the game theoretic value alone. That's not the game state.

Well obviously it's going to be confusing if you can't get the terms right.

But it's you who are confused. What you've just said is nonsense. Moving changes the game state. It's a different player to move for a start.

Your second sentence is correct. Your first sentence is incorrect in standard game theoretic terms. You're confusing "game state" with "game theoretic value". In a normally played version of chess without the 50/75M, 3/5R, agreed draw and resignation rules there are not 3 game states; there are around 4.8x10^44.

Another Grock of sh*te.

From https://medium.com/understanding-games/the-game-state-f57e3e512bf7

A game state refers to the current configuration of a game at a given point in time. It includes all of the information necessary to completely specify the game, such as the positions of all of the game pieces, the current score, the players’ turns, and any other relevant variables. The game state can change over time as the game progresses and actions are taken.

In some games, the game state may also include information about past events and actions that have taken place, as this can affect the current state of the game and the available options for future moves. Game state considerations are ever-present in all game design and in the development of artificial intelligence algorithms in video games.

In a board game like chess, the game state at any given point includes the positions of all of the pieces on the board, the players’ turns, and any special conditions or rules that may be in effect (such as en passant captures or castling).

If by "Fairytale time is OVER!" you mean you're going to stop posting screeds of crap from Grock - thank God for that!

AI's are quite easily led. This is useful when they have gone wrong and you need to hold their silicon hands a bit, but it also means if you put garbage in, they sometimes generate compatible garbage.

Strange incorrect addressee there!

Looking back, it looks like you were responding to @Optimissed post #19319.

Bit embarrassing. Sorry about that. It's been a (cough) long day.

AI image

I mated in 11 when I tried it against SF17, but I haven't tried to prove it.

Did you prove mate in 13?

As I said, I didn't try to prove it, but SF is obviously not to be trusted as you already showed.

It should be possible to do it by hand in a couple of hours or three. I don't know how long the mate solver would take. M11 might well be wrong.