Chess will never be solved, here's why

I rest my case here

The leeway afforded by the fact that such an amount of greater material can still be a forced draw is definitely the best argument for chess being a forced draw, but it is not conclusive.  To be conclusive, you would have to prove that black (or white) can force trades and exchanges to achieve a forced draw while down a piece, or two knights.  This requires removing all pawns from play while not allowing too great a material advantage.

You could posit a forcing strategy where black plays not really to maintain equilibrium, but to immediately and solely to remove all of white's pawns and exchange pieces down to a draw, but it is highly doubtful this strategy could be achieved without losing too much material in the process.  Thus, black plays to maintain parity, and if an opportunity arises to trade quickly down into a drawn ending, black can then take it...but not force it to happen.

#3990

"That is _NOT_ a general rule." ++ Pawn up = win is a general rule, but there are exceptions.

"It is highly position dependent."
++ Everything depends on position, even queen up is no win facing imminent checkmate.

"Likewise rook endings, and others." ++ Yes some rook endings with 1 or even 2 pawns down are sometimes drawn, and some opposite colored bishop endings even 3 or more pawns down and fortresses. That only adds evidence to chess being a draw. Even if white could miraculously convert his 1 tempo to 1 pawn, he must do it in a way that steers clear of the safe havens.

"pawn sacrifices are common" ++ Not common, but they do happen.
The Catalan, the Two Knights Defence, the Marshall, the Najdorf Poisoned Pawn.
However, the sacrifice must provide sufficient compensation.

1 e4 e5 2 Ba6 provides no compensation at all and can be dismissed.

"they can be sound (1. e4 e5 2. f4)" ++ 'It loses by force' - Fischer, 'I could not find a way for white to equalise' - Kramnik '23.4% black wins, 6.3% white wins' - AlphaZero Figure 4. (d)
https://arxiv.org/pdf/2009.04374.pdf

"So all your rule needs to become useful is a way to figure out which of the 10^40 or so positions it is true for and which it is false for." ++ No, I do not start with a set of 10^44 legal positions and then start to apply any rules on these.
Just like Losing Chess and Checkers have been weakly solved it is a calculation from the starting tabiya towards the 7-men endgame table base.
The good assistants launch the calculation and also stop it when they would agree on a draw or resign in a real correspondence game.

1 e4 e5 2 Ba6 loses a bishop for no compensation.
It is a sure loss for white, no doubt at all. So it can be dismissed.
1 Nf3 d5 2 Ng1 is nonsense, does not try to win and thus can be dismissed,
though it probably still is a draw.
1 a4 does nothing for the center and does not develop any piece and weakens square b4,
so it cannot be better than 1 d4 or 1 e4 and can be dismissed.

Your self awareness is lacking, as always.  You look worse every time you engage with me without my having directed anything your way.  Take your own advice, and work on your own maturity.

#3997
"There was no need to continue your argument with tygxc. He is not going to alter his opinions."
++ Why? There has been no valid counterargument of any kind.

1) A single tempo is not enough to win and TCEC, ICCF, AlphaZero and human GM games confirm it: chess is a draw. Sveshnikov and others were right.

2) Weakly solving chess requires less positions 10^17 than strongly solving 10^44.
Losing Chess was weakly solved with 10^9 positions and Checkers with 10^14 positions.
Sveshnikov was right: existing computers can weakly solve chess in 5 years.

I don't aspire to change any crackpot's mind, yours or his.  It's not possible to reason with somebody who is unreasonable.  The goal is to show that cracked pottery to everyone else, so they do not become crackpots themselves.

I cant tell if you guys love or hate each other that must be why they say its a thin line.  Its like an abusive relationship where they keep going back anyway.  That's kind of what i said before though if you cant even agree on what words mean what makes you think you can agree on this ever.  We could have the 32 piece table base floating on a alien spacecraft that literally has the answers people would still be like " nah not buying it fam" . 

Exercises for a reader more capable of reasoning clearly than @tygxc:

1. Exhibit a position where a single tempo is sufficient to win (i.e. having the move makes the difference between winning and not winning)
2. Exhibit a position where a single tempo is sufficient to lose (i.e. having the move makes the difference between losing and not losing). [Hint:  in chess theory this has a German name beginning with "Z"].

So, strictly speaking, it is not a general rule. How many exceptions, in percentage?

Unproven.

Appeal to authority.

Afaik, in checkers (a simpler game than chess) some openings are considered "trivial" and they had not been checked when the game was announced solved. There is ongoing computation to solve them too, though. Losing chess has been solved from the initial position, as you well know.

They cannot check all the lines a computer would search in 5 years, so it could evaluate as worse lines that in fact are better and prune them, according to an algorithm (sort of) you have provided (which cuts off lines on the basis of unproven assumptions), without the good assistants being able to intervene.

Repetition. Unproven.

Unproven.

Non sequitur. It is not proved that those strategic rules are good for any situation. 1. a4 gives a worse expected score in practical play; that does not imply its game-theoretic value is lower than 1. d4 or 1. e4. It has to be proven by a "formal" proof, as you call it.

Your usual "provability is a higher degree of truth" is an ambiguous, out of the context statement, which does not say anything about the possibility to know that unproven things are true; and you said you read it on Scientific American, but do not remember the exact reference, therefore nobody can falsify you.

Chess is solved I solved it, you're all noobs

#4001
"If Shveshnikov were still alive and he changed his mind, would that convince you?"
++ He would not have any reason to change his mind: he was right.
All facts and figures support his bold claim.
The only thing that would convince me is a valid counterargument.
So far I have only read insults, not one single even remotely valid counterargument.
The first people who said humans can walk on the Moon also met unfounded criticism.

#4008

"So, strictly speaking, it is not a general rule." ++ It is a general rule, but has exceptions.

"1 e4 e5 2 Ba6 provides no compensation at all and can be dismissed.
Unproven." ++ I provided proof above: it is a forced checkmate in 82.

""they can be sound (1. e4 e5 2. f4)" ++ 'It loses by force' - Fischer, 'I could not find a way for white to equalise' - Kramnik '23.4% black wins, 6.3% white wins' - AlphaZero Figure 4. (d)
https://arxiv.org/pdf/2009.04374.pdf 
Appeal to authority."
++ Expert opinions plus independent calculations with no other input but the Laws of Chess

"Afaik, in checkers (a simpler game than chess) some openings are considered "trivial" and they had not been checked when the game was announced solved. There is ongoing computation to solve them too, though. Losing chess has been solved from the initial position, as you well know."
++ Losing Chess has the same 64 squares, 32 men, 6 kinds of men as Chess and needed only 10^9 positions not 10^44 to weakly solve it by interaction of humans and computers. It has been solved variation by variation, simplest first. The humans selected the course and the computers verified by calculation until the table base.

"They cannot check all the lines a computer would search in 5 years"
++ They avoid useless calculations in clear wins, clear draws, or meaningless lines.

"1 e4 e5 2 Ba6 loses a bishop for no compensation.
It is a sure loss for white, no doubt at all. So it can be dismissed.
Repetition. Unproven." ++ I provided proof above: it is a forced checkmate in 82.

"1 Nf3 d5 2 Ng1 is nonsense, does not try to win and thus can be dismissed.
Unproven."
++ This is ridiculous. So you think 1 Nf3 d5 2 Ng1 is a good try to win, better than 1 e4 or 1 d4?

"It is not proved that those strategic rules are good for any situation. 1. a4 gives a worse expected score in practical play; that does not imply its game-theoretic value is lower than 1. d4 or 1. e4." The game-theoretic value of 1 a4 may well be the same as 1 d4 or 1 e4: a draw. The point is that it is unthinkable that the game-theoretic value of 1 d4 and of 1 e4 is a draw and that the game-theoretic value of 1 a4 were a white win. The argument is not about practical play, it is about the accomplishment of the move in terms of the center and development.
AlphaZero ranked all first moves with no other input but the Laws of Chess and thus acquired chess knowledge, i.e. a set of theorems derived from axioms: the Laws of Chess by logic: boolean operations.
https://arxiv.org/pdf/2111.09259.pdf 

#4004

"Exercises for a reader more capable of reasoning clearly than @tygxc:"
++ You clearly are not such a reader.

"Exhibit a position where a single tempo is sufficient to win" ++ That is completely besides the question. It is a about a single tempo in the initial position, not in some pawn endgame.

Yes. the handy link URL tool works better.

@4016 

"The method you propose seems to have guidance from GMs who are supposed to curtail irrelevant lines."
++ Yes, the good assistants launch calculations from relevant starting points and end calculations whenever there is no more doubt about the draw or win, i.e. when they would agree on a draw or resign in a correspondence game.

"Yet we're talking about examining billions of relevant positions in five years."
++ More exactly 10^17 positions, that is 100 million billion positions.

"Therefore, the number of positions to be examined is far in excess of that number."
++ No, the number of positions to be examined is the number of positions to be examined.
For comparison: Checkers was solved with a proof tree of 10^7 positions and a solution tree of 10^14 positions i.e. for each position in the proof tree there were 10^7 positions examined.

"Consequently it would be necessary to develop an algorithm, to do it automatically."
++ No, human grandmasters plus Stockfish on cloud engines is enough.
Checkers was solved with a human Schaeffer with his program Chinook.

"I think Sveshnikov overlooked the fact that a reliable solution means 100% accuracy."
++ What makes you think that? I think Sveshnikov was well aware of all ramifications. He was a grandmaster and 65+ World Champion. He was a professional analyst and he had analysed before and after engines. He held a MSc in engineering. He authored several books with analysis. He even taught aspiring masters how to analyse with engines.

"There can't be a single error or it isn't a reliable proof or solution."
++ That is with every proof. That already was the case with the Four Color Theorem.

"The GMs couldn't guarantee 100% accuracy even if they had the time to look properly at the positions."
++ They can. They launch the calculations. They stop the calculation when they would resign or agree on a draw. ICCF correspondence players also resign lost positions and agree on a draw in drawn positions. They never resign any tenable position or agree on a draw in a won position.

"That is why your proposed solution in 5 years is definitely non-viable."
++ That is why the proposed solution in 5 years by Sveshnikov is viable.

The pedantic adherence to using transient and possibly faulty post numbers is directly analogous to the pedantic adherence to using faulty assumptions and numbers in trying to solve chess .

@btickler are you ok I?

Chess is exact and finite, and with all respect, that doesn't depend on your ability of comprehension at the moment

Why wouldn't I be ok?

I am not sure you are applying "that doesn't depend on your ability of comprehension at the moment" at the target you meant to.

Finally!

Good on you sir!