Chess will never be solved, here's why

Yes I can't agree with tygxc's separation of different types of blunder. It's just completely wrong, because anything that reduces the game-state from any forced result to a forced result which is worse for one party is a blunder.

This misses most of the detail in the calculation, and is:

(1) Taken from games that are played under different rules from the nebulous game you offer to solve.

(2) Not played by the vehicle (Stockfish, version yet to be documented) you say you plan to use.

(3) From a position where none of the results can be reliably checked.

(4) Verifiably wrong in numerous positions that can be checked from tablebases.

It's based on the assumption that the occurrence of blunders in a game is a Poisson process. So you're postulating e.g. that SF? will make as many blunders in KNNvKP positions (where it normally blunders) as in KRvK positions (where it normally doesn't).

Moreover the material on the board enters nowhere into your "reasoning", so it should apply irrespective of material. Your assumption is also that the probability of a second half point blunder in any position is the same as the first, so unless you're asserting that only full point blunders occur (which invalidates your Poisson process assumption straight away) your reasoning should apply equally to drawn or winning positions. 

For the above reasons I have posted some games (reproduced below) where your "calculation" can be checked against perfect play by reference to tablebases and invited you to apply your calculations to those games. I've added the blunders both with and without the 50 move (resp. CRblunder and BRblunder) in the last game to start you off.

You've been pretending not to notice the first set for the best part of a year and you've been pretending not to notice the rest for at least the last dozen pages, though I've reminded you several times.

I'm inclined to guess, possibly unkindly, that you've already tried and failed to get your calculations to work in these positions, but having convinced yourself that your proposed "solution" is a non-starter, are ignoring these reminders because you just get a perverted pleasure from posting as much misinformation as you can on the internet.

You can prove that guess wrong by either successfully showing that your calculation works in those games or acknowledging that you've been posting so much BS and ceasing to plug your "solution". I challenge you to do one or other.

If you disregard the terminology...... obviously there are many kinds and degrees of mistakes, referred to as blunders in chess. Are we suggesting that all mistakes are equal, or can we say, "Although a blunder is a blunder is a blunder, and they all make the forced result worse for the blunderer, there are degrees. Some blunders change a win to a draw, some change a draw to a loss, and some change a win to a loss."  So, tygxc's differentiation kind of makes sense to me.....even though I don't see those definitions as pertinent to whether chess can be solved. 

@6332

"solving chess is purely mathematical" ++ Agree

"with zero consideration of such things as confidence levels or statistical treatments"
++ Solving itself is different from arguments about it.

"If someone solves chess to the point of being 99.99% confident" ++ The proposed method makes 1 error in 10^20 positions, while there are only 10^17 relevant positions.

@6337

"tygxc's differentiation kind of makes sense to me" ++ Of course it makes sense, it is the only sensible definition. It is not even mine, it stems from GM Dr. Hübner.

"I don't see those definitions as pertinent to whether chess can be solved"
++ Chess can be weakly solved, the question is in what time. In the arguments about that it is pertinent to define error. The definition calls for both players to play optimally. Playing optimally is play without error.

@tygxc hello... hello... hello... hello...hello...hello... hello... ...

...

...

...

...

Then, silence. Some fancied they heard in the air

   A weary and wandering sigh

That resembled a sum but the others declare

   It was only a breeze that went by.

To take an extreme example, the obvious blunder is white allowing black a scholar's mate. At the other end of the scale, a player commits an inaccuracy which allows a forced loss but it's difficult to spot and execute. Ask yourself whether it's a blunder, though. They both lose. It may be that the second example wouldn't have occurred if the player was adhering to rules of thumb and positional considerations. What you actually seem to be saying is that if a weak player makes a losing move, it may not be as bad a blunder as if a strong player had made it. I suppose there may be something in that .... an understandable blunder.

But it's still a move which changes the optimum game result, negatively for the player making the move. Common sense certainly tells us that tygxc is wrong to differentiate between
win > draw and win > loss.

And obviously, so was Dr Hubner. A title doesn't make someone's opinions accurate. A physician may not always get the diagnosis right. A judge may not always sum up evidence accurately and without bias. It's ridiculous to name-drop in that manner.

I'm just suggesting that there are different degrees of blunders, so I don't have a problem, per se, with tygxc's differentiation of them. 

But a true solution of chess would treat all blunders the same......i.e. avoidance. 

I understand you, which is why I prefer "blunder" to mean a silly mistake or oversight. A blunder is therefore always a silly and bad mistake, in that context.  Something that with more care would have been avoided so it implies a basic failing wrt duty of care. A mistake, to me, is a normal error, which may change an optimum outcome negatively or may not.

You can't have a double blunder. If it refers to one blunder then it's nonsense, Hubner or no Hubner.

Wrong

There's nothing wrong with @tygxc's differentiation between errors that change a theoretical win into a theoretical loss and errors that either change a theoretical draw into a theoretical loss or a theoretical win into a theoretical draw. 

There is a problem with his terminology, exactly as @Elroch points out here.

A practical consequence is that I have in the past been using the term "error" to mean "half point blunder" and "blunder" to mean "full point blunder" when responding to @tygxc and reverting to standard in other responses. This is likely to cause confusion all round, so I've lately reverted to standard in some of my responses to @tygxc - no doubt causing even more confusion.

@tygxc is, I would judge, unlikely to change his terminology, so the best thing is probably to ignore his posts altogether. I would say he has comprehensively demonstrated that he is deliberately trolling.

So I would suggest that all should use the terms "half point blunder" and "full point blunder" in the sense generally used by game theorists, to avoid talking at cross purposes.

Note that the terms represent different moves depending on whether the 50 move and 3-fold repetition rule are in force or not. In the first set of games (KNNvKP) that I posted for @tygxc, SF made 30 basic rules blunders and 28 blunders with the rules in force, but only 4 of those were blunders in both games. Similarly in the last game that I annotated there were 2 blunders with the rules in force and 1 without that was neither of those.

The degrees of blunder you mention certainly bear examination and I'll come back to that, but if they're not actually theoretical blunders I think we should refer to them as errors of varying severity. The level of severity very much depends on the level of play.   

E.g. In this game the analysis gives me

Moves 68B (the unique most accurate move) and 72W are flagged as blunders. These are not blunders at the level of Javitotwit, newbie4711, Syzygy or Nalimov, but they are blunders at the level of Coach (with my subscription).

I think you are thinking of a Heinlein novel, I just don't know which one has it.

Somebody got unmuted.  Congrats.

@tygxc, someone buys a lottery ticket in a one in a thousand lottery. Do you think you can prove the ticket will not win?

If you can answer that correctly you will see the error with your reasoning:

"The proposed method makes 1 error in 10^20 positions, while there are only 10^17 relevant positions."

I eliminated "Space Cadet" by scanning 159 pages. Just a few more novels to go.

The name of the short story was Flowers for Algernon. Algernon was his pet mouse, who received a trial of the drug. Algernon died. It was very famous and made into a film much later, I believe. But it was a short story and on reflection I don't think it was the one.

I can....based on the fact that he has previously bought 10^17 lottery tickets and never won. And several Lottery Masters have agreed that he can't win.   
Q.E.D. 

In that case I think a court might accept it as proof the lottery was fixed.

I've just read the first third of "Time for the Stars". It probably isn't that one, but it was one of my favourites as a teenager. There was an early chapter called "the natural logarithm of two".