Chess will never be solved, here's why

Sort:
Avatar of tygxc

@8692

"And every theorem in the mathematical sciences (including computer science and game theory) has NO uncertainty."
++ Many have, like Shannon's theorem, the Uncertainty principle and many more.

Avatar of Elroch

You're talking about engines that blunder all the time in difficult tablebase positions. It's ridiculous to suggest they always make zero errors. Sometimes, sure. Often, maybe. Always, no.

The difference between zero errors and 0.1 errors is as big as the difference between 1 and infinity on an appropriate scale. Zero is not a small strictly positive number. It is fundamentally different.

Avatar of tygxc

@8693

"I could draw again a gm anyday" ++ You are rated < 2000 chess.com...

Avatar of Elroch
tygxc wrote:

@8692

"And every theorem in the mathematical sciences (including computer science and game theory) has NO uncertainty."
++ Many have, like Shannon's theorem, the Uncertainty principle and many more.

No.

If you do not understand the above word, you need to do that intermediate proof class that @MEGACHE3SE recognised you didn't have.

Avatar of tygxc

@8705

"The difference between zero errors and 0.1 errors"
++ 0.1 error does not exist. There is either an error or there is none.
The number of errors in a game is a natural number.

Avatar of MARattigan
tygxc wrote:

@8675

"these engines are just reallly strong"
++ ICCF (grand)master + engines at average 5 days/move
are much stronger than engines running unjockeyed,
and these are much stronger than the strongest humans at 3 minutes/move.

As for the latter, consider the 2024 Toronto Candidates' Tournament.
Out of 56 games there were 25 decisive games.
Fitting a Poisson distribution of the errors/game leads to a distribution:

  • 0 error: 18 games
  • 1 error: 21 games
  • 2 errors: 12 games
  • 3 errors: 4 games
  • 4 errors: 1 game
    The average is 1.1 error/game.

But why are you fitting a Poisson distribution in particular?

You also have a choice of fitting a Bernoulli distribution, a Rademacher distribution, a beta-binomial distribution, a degenerate distribution, a discrete uniform distribution, a hypergeometric distribution, a negative hypergeometric distribution, a Fisher's noncentral hypergeometric distribution, a Wallenius' noncentral hypergeometric distribution, a soliton distribution. a power-law distribution, a Zipf distribution, a beta negative binomial distribution, a Boltzmann distribution, a Gibbs distribution, a Maxwell–Boltzmann distribution, a Borel distribution, a discrete phase-type distribution, an extended negative binomial distribution, a Gauss–Kuzmin distribution, a geometric distribution, a Hermite distribution, a logarithmic (series) distribution, a mixed Poisson distribution, a negative binomial distribution, a discrete compound Poisson distribution, a parabolic fractal distribution, a displaced Poisson distribution, a Conway–Maxwell–Poisson distribution, a zero-truncated Poisson distribution, a Polya–Eggenberger distribution, a Skellam distribution, a skew elliptical distribution, a Yule–Simon distribution, a zeta distribution, a Hardy distribution, a Beta distribution, a four-parameter Beta distribution, an arcsine distribution, a PERT distribution, a uniform distribution, an Irwin–Hall distribution, a Bates distribution, a logit-normal distribution, a Kent distribution, a Kumaraswamy distribution, a logit metalog distribution, a Marchenko–Pastur distribution, a bounded quantile-parameterized distribution, a raised cosine distribution, a reciprocal distribution, a triangular distribution, a trapezoidal distribution, a truncated normal distribution, a U-quadratic distribution, a von Mises–Fisher distribution, a Bingham distribution, a Wigner semicircle distribution, a continuous Bernoulli distribution, a Henyey–Greenstein phase function, a Mie phase function, a von Mises distribution, a wrapped normal distribution, a wrapped exponential distribution, a wrapped Lévy distribution, a wrapped Cauchy distribution, a wrapped Laplace distribution, a wrapped asymmetric Laplace distribution, a Dirac comb of period 2π, a Beta prime distribution, a chi distribution, a noncentral chi distribution, a chi-squared distribution, an inverse-chi-squared distribution, a noncentral chi-squared distribution, a scaled inverse chi-squared distribution, a Dagum distribution, an exponential distribution, an exponential-logarithmic distribution, an F-distribution, a noncentral F-distribution, a folded normal distribution, a Fréchet distribution, a Gamma distribution, an Erlang distribution, an inverse-gamma distribution, a generalized gamma distribution, a generalized Pareto distribution, a Gamma/Gompertz distribution, a Gompertz distribution, a half-normal distribution, a Hotelling's T-squared distribution, an inverse Gaussian distribution, a Lévy distribution, a log-Cauchy distribution, a log-Laplace distribution, a log-logistic distribution, a log-metalog distribution, a log-normal distribution, a Lomax distribution, a Mittag-Leffler distribution, a Nakagami distribution, a Pareto distribution, a Pearson Type III distribution, a phase-type distribution, a phased bi-exponential distribution, a phased bi-Weibull distribution, a semi-bounded quantile-parameterized distribution, a Rayleigh distribution, a Rayleigh mixture distribution, a Rice distribution, a shifted Gompertz distribution, a type-2 Gumbel distribution, a Weibull distribution, a modified half-normal distribution, a Polya-Gamma distribution, a modified Polya-gamma distribution, a Behrens–Fisher distribution, a Cauchy distribution, a centralized inverse-Fano distribution, a Chernoff's distribution, an exponentially modified Gaussian distribution, an expectile distribution, a Fisher–Tippet extreme value distribution, a Fisher's z-distribution, a skewed generalized t distribution, a gamma-difference distribution, a generalized logistic distribution, a generalized normal distribution, a geometric stable distribution, a Gumbel distribution, a Holtsmark distribution, a hyperbolic distribution, a hyperbolic secant distribution, a Johnson SU distribution, a Landau distribution, a Laplace distribution, a Lévy skew alpha-stable distribution, a Linnik distribution, a logistic distribution, a map-Airy distribution, a metalog distribution, a normal distribution, a normal-exponential-gamma distribution, a normal-inverse Gaussian distribution, a Pearson Type IV distribution, a Quantile-parameterized distribution, a skew normal distribution, a Student's t-distribution, a noncentral t-distribution, a skew t distribution, a Champernowne distribution, a type-1 Gumbel distribution, a Tracy–Widom distribution, a Voigt distribution, a Chen distribution, a Magnum Extra Large Size Silicone Lubricated Condom, and a host of other things that would be equally likely to impress the uninformed.

In fact, given that it's a chess site, something like Fisher's z-distribution might be more persuasive to your intended audience.

The problem with quoting a Poisson distribution is that the first sentence in the link you give for it is 

In probability theory and statistics, the Poisson distribution is a discrete probability distribution that expresses the probability of a given number of events occurring in a fixed interval of time if these events occur with a known constant mean rate and independently of the time since the last event.

Not only is that a patently stupid assumption (even to the uninformed) to make of the moves by either player in a chess game, but if you do assume that the moves have an independent fixed probabilty of losing half a point it's easy to prove that chess is a Black win. (The game shown is valid in FIDE basic and competition rules and ICCF chess.)

But it's also obvious that choosing a different game that ends in a provable White win in the link would prove that chess is a White win from the same assumption. Which proves the assumption false, because both cannot be true.

Given that ICCF (grand)master + engines at 5 days / move >> human at 3 min / move
this makes it plausible that 106 draws out of 106 games indeed means 0 error / drawn game,
i.e. an error distribution of 106 - 0 - 0 - 0.

Avatar of tygxc

@8695

"computers will continue to draw in the future" ++ ICCF is not computers, it is a human with computers. Here is an interview with the reigning ICCF World Champion ICCF GM Jon Edwards. It gives some insight in how ICCF correspondence chess is now played at top level and what is the role of the human and his computers.

"chess being a draw" ++ Yes

"the ICCF doesnt change it" ++ It does: it shows how to draw.
It also shows there are several ways to draw.

Avatar of Elroch

There is no evidence that Stockfish 16 jockeyed by Jon Edwards can beat Stockfish 16 on its own.

Avatar of tygxc

@8696

"proof is direct deduction using only axioms" ++ No. Inductive proofs are valid too.

"you still havent given your math education" ++ More than any here and much more than you.

Avatar of tygxc

@8711

"There is no evidence that Stockfish 16 "assisted" by Jon Edwards can beat Stockfish 16 on its own." ++ There is: he qualified for the World Championship Finals, defeating other candidates with Stockfish, maybe some who are stupid enough to just play what Stockfish indicated.

Avatar of MARattigan
tygxc wrote:

@8695

"computers will continue to draw in the future" ++ ICCF is not computers, it is a human with computers. Here is an interview with the reigning ICCF World Champion ICCF GM Jon Edwards. It gives some insight in how ICCF correspondence chess is now played at top level and what is the role of the human and his computers.

That makes no difference. Equally matched humans draw in exactly the same way as computers when they're out of their depth. I've posted you many examples of that using Stockfish and you've posted us many examples with Stockfish+human.

"chess being a draw" ++ Yes

"the ICCF doesnt change it" ++ It does: it shows how to draw.
It also shows there are several ways to draw.

I can show you much quicker ways, but none are relevant to the topic of the thread.

Avatar of BigChessplayer665
tygxc wrote:

@8693

"I could draw again a gm anyday" ++ You are rated < 2000 chess.com...

Over 2000 lmao I play rapid on lichess...

Around 2200(rapid) lichess and on blitz I'm 2100 chess.com

Also who said rating was everything I surprise GMs all the time ?

2100 blitz is still a 2000 wether you think it is real chess or not

Avatar of MARattigan
tygxc wrote:

@8696

....

"you still havent given your math education" ++ More than any here and much more than you.

Seems very unlikely. You're very incompetent at mathematics from your postings.

Avatar of BigChessplayer665

Txgyc you look like you have a issue of underestimating potential effects just like my elo (and skill )

Just because stockfish draws a bunch of games doesn't mean you assume perfect play

The the only time you assume perfect play is when it is perfect play

Ps:I'm also 2170 rapid chess.com on a different account so technically I'm also higher rated than you lol

Avatar of Elroch
tygxc wrote:

@8696

"proof is direct deduction using only axioms" ++ No. Inductive proofs are valid too.

Here you reveal you are not aware there are two unconnected uses of the word "induction".

Mathematical induction is a form of deduction that has no connection with inductive reasoning which never constitutes a proof.

I understand that some people have difficulty coping with the fact that a word can be used in two unconnected ways, but that does not affect the relevance of this.

Note that mathematical induction ALWAYS reaches a definite conclusion without uncertainty (like all deductive proofs) and inductive reasoning NEVER reaches a definite conclusion - it always has uncertainty. While mathematical induction is a form of proof, inductive reasoning is about forming an uncertain belief about a population based on an incomplete sample of its members.

This alone is enough to see that not only are the concepts different, they do not even overlap.

"you still havent given your math education" ++ More than any here and much more than you.

Now you need to fill in the gap in your education that meant I had to explain the above.

I forecast that in the future you will have forgotten that there is no overlap between mathematical induction and inductive reasoning, and will confuse the two again.

Avatar of tygxc

@8698

"having 106 draws is not even good evidence we won't see a win in the next 106 games"
++ That is right, I even expect a decisive game in the ongoing 30 and because of human error.
The point is not to predict future games, but rather to assess the quality of the 106 draws we have: perfect play, 0 error.

"they always compare the current best engine to itself" ++ No. They compare one ICCF (grand)master with engines to another ICCF (grand)master with engines. Their engines may be different. Their hardware is different. The tuning of their engines is different. The use of their engines is different. The time per move is different.

"If instead you compare the 2024 best engine to the 2019 best engine it will win some games"
++ Yes. And in previous ICCF WC Finals there were decisive games, every year fewer, now none.

"it is likely that if you play the 2029 best engine against the 2024 best engine, it will win some games, despite the 2024 best engine getting 106 draws against itself." ++ First it is not engine vs. engine, but ICCF (grand)master + engines vs. ICCF (grand)master + engines.
Second, you cannot go below zero error per game. Maybe the 2029 ICCF WC Finals if still organised will reach the same result of all draws with 5 hours/move instead of 5 days/move.

Avatar of MARattigan
tygxc wrote:

@8711

"There is no evidence that Stockfish 16 "assisted" by Jon Edwards can beat Stockfish 16 on its own." ++ There is: he qualified for the World Championship Finals, defeating other candidates with Stockfish, maybe some who are stupid enough to just play what Stockfish indicated.

In what way is that evidence? A match between Jon Edwards and vanilla Stockfish would be evidence.

It would indeed be interesting if the Finals included an equal number of vanilla SF and human+engine players.

But, of course, neither will happen.

Avatar of Elroch

Yes, it is entirely plausible that he won because Stockfish was handicapped by its jockeys in the earlier matches.

Avatar of Elroch
tygxc wrote:

Second, you cannot go below zero error per game.

You need refreshing about very elementary things all the time.

A sample does not tell you everything about the underlying statistics. If you randomly draw 106 white balls from an urn, this does not prove the urn contains no black balls. Rather it is good statistical evidence that the urn contains a high proportion of white balls.

I quantified what you could infer earlier in this discussion but you are making the same mistake again. 106 draws is evidence that the fraction of decisive games in a very long match would probably not be a very big percentage and would most likely be less than 1%. Less than 1% is not zero.

Avatar of tygxc

@8720

"A match between Jon Edwards and vanilla Stockfish would be evidence."
++ That would as stupid as a match between Magnus Carlsen and MARAttigan.
Vanilla Stockfish has no chance at all.
Edwards qualified for the World Championship finals and won it.
He managed to win 2 games against finalists with engines.
There are 3 games attached to the interview I liked to.