Chess will never be solved, here's why

Sort:
Kotshmot
tygxc wrote:

@4716

"Problem is as follows: I explain why poisson distribution isn't accurate here to predict errors"
++ It need not even be accurate, approximate is enough.

"it could be a huge margin" ++ That is for you to prove. It is a plausible distribution.
It is used for many similar problems. It can be slightly off, but not by a huge margin.

"using poisson distribution to show how many errors per game there are"
++ That is what is done in many sciences.
Example:
A voltage V accelerates an electron with charge e and mass m, what velocity v does it reach?
Answer:
Assume that v << c speed of light.
Thus Newtonian mechanics applies
thus mv² / 2 = eV
thus v = sqrt (2V e / m)
Now check
if v << c then that calculation is valid, else relativistic calculation is needed.

"Amount of wins and draws is not enough to determine error probability because the errors don't follow poisson distribution." ++ Poisson is a plausible distribution, it cannot be far off.

"We are in the dark." ++ We are in the light, but you make it dark.

"Because when we can't rule it out we have to consider it as an option even if its unlikely."
++ I did consider a white win or a black win as options, found them incompatible with the observed data, and also incompatible with other inductive and deductive evidence.

Now come back to: 9 games with 2 errors ++ 6 white wins with 2 errors (?), (?) that undo each other and 3 black wins with a white blunder (??)

Here are the 6 white wins:
https://www.iccf.com/game?id=948179
https://www.iccf.com/game?id=948250
https://www.iccf.com/game?id=948217
https://www.iccf.com/game?id=948198
https://www.iccf.com/game?id=948222
https://www.iccf.com/game?id=948273

And here are the 3 black wins:
https://www.iccf.com/game?id=948180
https://www.iccf.com/game?id=948268
https://www.iccf.com/game?id=948246 

I say I can pinpoint the 1 error (?) in all 9 decisive games, usually the last move.
Can you pinpoint the white blunder (??) in the 3 black wins?

"It need not even be accurate, approximate is enough"

The point is that we know for a fact that errors in chess don't follow poisson distribution because the probability of the events is not independent of each other. By how much the probabilities are off with poisson distribution is pure speculation. The point is that we cant rely on it to rule out error distributions that poisson does not support.

If you really want to see how much poisson can be off, just play with scenarios where you have ie. a series of 100+ games where the errors would divide unevenly in clusters, just like they can in a chess game. You'll notice that a probability of a high error game is calculated way lower than it could in reality be.

"Can you pinpoint the white blunder (??) in the 3 black wins?"

I'm not trying to solve chess here unless I'm payed money

 

 

tygxc

@4718

"the probability of the events is not independent of each other."
++ You do not know if they are dependent or by how much.
Now assume they are independent and Poisson applies.
Then the result is that there is only 0 or 1 error.
So even if they were dependent it does not matter as there is no more than 1.
So the assumption was valid and Poisson applies.

"By how much the probabilities are off with poisson distribution is pure speculation."
++ Poisson is a plausible distribution. There being a large interdependence is pure speculation. Even if there is some interdependence, it plays no role, as there are only 0 to 1 errors.

"The point is that we cant rely on it to rule out error distributions that poisson does not support." ++ But then you have to say what error distribution you find more appropriate and calculate what results it yields. 

"play with scenarios where you have ie. a series of 100+ games where the errors would divide unevenly in clusters, just like they can in a chess game."
++ I am not talking about blitz games between 1700 rated players.
I talk about the ICCF World Championship Finals, with ICCF (grand)masters with engines and 50 days per 10 moves. So I start with conditions that lead to sparse errors.

Kotshmot
tygxc wrote:

@4718

"the probability of the events is not independent of each other."
++ You do not know if they are dependent or by how much.
Now assume they are independent and Poisson applies.
Then the result is that there is only 0 or 1 error.
So even if they were dependent it does not matter as there is no more than 1.
So the assumption was valid and Poisson applies.

"By how much the probabilities are off with poisson distribution is pure speculation."
++ Poisson is a plausible distribution. There being a large interdependence is pure speculation. Even if there is some interdependence, it plays no role, as there are only 0 to 1 errors.

"The point is that we cant rely on it to rule out error distributions that poisson does not support." ++ But then you have to say what error distribution you find more appropriate and calculate what results it yields. 

"play with scenarios where you have ie. a series of 100+ games where the errors would divide unevenly in clusters, just like they can in a chess game."
++ I am not talking about blitz games between 1700 rated players.
I talk about the ICCF World Championship Finals, with ICCF (grand)masters with engines and 50 days per 10 moves. So I start with conditions that lead to sparse errors.

"There being a large interdependence is pure speculation. Even if there is some interdependence, it plays no role, as there are only 0 to 1 errors."

Everything here is speculation. Thats the whole point, we don't rule out anything unless we have proof. Right now we dont have enough info to rule out there could be much more errors.

If there is interdependence there could be more errors than 0-1 because poisson distribution is not able to predic them.

Thats where we are at. Your theories are all fine in this topic and you could be right, but there are other options that can't be mathematically ruled out. 

Then of course the practical side of solving chess is whole another discussion but it's important to understand where we are now.

tygxc

@4721

"we dont have enough info to rule out there could be much more errors."
++ At least make it plausible there would be more errors.

"If there is interdependence there could be more errors than 0-1 because poisson distribution is not able to predic them."
++ If the Poisson distribution leads to 74 - 77 - 40 - 14 - 4 - 1 like for the Zürich 1953 Candidates', then you could argue that the 40 - 14 - 4 - 1 need modification as there are more than 1 errors and they might be slightly interdependent.
However for the 30th ICCF WC Finals the result is 127 - 9 - 0.

"there are other options that can't be mathematically ruled out"
++ It does not matter if it is 99.7% sure or 99.4% or 98.5%.
The point is that we already have like 1000 perfect games with 0 errors: ICCF WC Finals draws.

"the practical side of solving chess is whole another discussion"
++ That is the topic of this thread.

"it's important to understand where we are now"
++ I say we have 1000 perfect ICCF draws > 99% sure to contain 0 errors that can serve as a backbone for weakly solving chess by peeling back the white moves one by one from the end towards another game. 

Bot_Boy

Advanced AI has a higher probability of solving Chess than solving your arguments!

237 pages later....

Chess will never be solved.

End of discussion!draw

tygxc

@4725
Existing computers can weakly solve chess in 5 years, like GM Sveshnikov said.

Kotshmot
tygxc wrote:

@4721

"we dont have enough info to rule out there could be much more errors."
++ At least make it plausible there would be more errors.

"If there is interdependence there could be more errors than 0-1 because poisson distribution is not able to predic them."
++ If the Poisson distribution leads to 74 - 77 - 40 - 14 - 4 - 1 like for the Zürich 1953 Candidates', then you could argue that the 40 - 14 - 4 - 1 need modification as there are more than 1 errors and they might be slightly interdependent.
However for the 30th ICCF WC Finals the result is 127 - 9 - 0.

"there are other options that can't be mathematically ruled out"
++ It does not matter if it is 99.7% sure or 99.4% or 98.5%.
The point is that we already have like 1000 perfect games with 0 errors: ICCF WC Finals draws.

"the practical side of solving chess is whole another discussion"
++ That is the topic of this thread.

"it's important to understand where we are now"
++ I say we have 1000 perfect ICCF draws > 99% sure to contain 0 errors that can serve as a backbone for weakly solving chess by peeling back the white moves one by one from the end towards another game. 

"At least make it plausible there would be more errors"

I don't have to make anything plausible, I'm just pointing out the obvious - What conclusions we can make with the current information and what can we rule out just looking at stats and probabilities. You're presenting something as the back bone of solving chess that is on uncertain grounds. 

tygxc

@4731

"You're presenting something as the back bone of solving chess"
++ Yes indeed, according to my calculations over 1000 ICCF WC Finals games are 99.7% certain to be perfect games with 0 errors. Those games already represent years of engine and ICCF (grand)master calculations. Thus those games are a good start to weakly solving chess by the peel back procedure from the last move towards another of those games. About 3 of those > 1000 draws will fail the test and after scrutinization will be found to contain 2 errors that undo each other. 

Elroch

Kasparov (exact quote) - "A machine will always remain a machine, that is to say a tool to help the player work and prepare. Never shall I be beaten by a machine!"

Sveshnikov (exact second-hand quote) - "Give me five years, good assistants and modern computers, and I will trace all variations from the opening towards tablebases and 'close' chess"

tygx (paraphrased) - "chess players stronger than me are 100% reliable in their statements."

MF972

Well, Kasparov is definitely wrong in this one. Today any human player is beaten by machines.

Sveshnikov might be right but I think 5 years is an underestimation. Si far, king's gambit is the only opening that has been "solved", afaik.

Sylvester_P_Smythe2

This Topic Question, does determine whether Chess is indeed solvable or not.

 

https://www.chess.com/forum/view/general/pawns-only-game

Sylvester_P_Smythe2

The above determines the theoretical answer to this question.

Sylvester_P_Smythe2
Sylvester_P_Smythe2 wrote:

The above determines the theoretical answer to this question.

 

If only all Pawns for both sides determines a win for White or Black or Both Sides, then a set up with all the pieces shouldn't make any difference.

Sylvester_P_Smythe2
Sylvester_P_Smythe2 wrote:
Sylvester_P_Smythe2 wrote:

The above determines the theoretical answer to this question.

 

If only all Pawns for both sides determines a win for White or Black or Both Sides, then a set up with all the pieces shouldn't make any difference.

 

Further Evidence, that Pawns, are indeed...,

THE SOULS of Chess!

MARattigan
Sylvester_P_Smythe2  wrote:

The above determines the theoretical answer to this question.

Wouldn't this do just as well?

or this perhaps?

 

MARattigan
Elroch wrote:

...

tygx (paraphrased) - "chess players stronger than me are 100% reliable in their statements."

Stronger than or equal.

Sylvester_P_Smythe2
MARattigan wrote:
Sylvester_P_Smythe2  wrote:
 

The above determines the theoretical answer to this question.

Wouldn't this do just as well?

or this perhaps?

 

Nope.

Because unlike the two positions you showed, the One I composed, is not shown yet, to be an automatic Draw.

Nice try though, Troll!

THREAD K*LLER.

tygxc

@4731
"Si far, king's gambit is the only opening that has been "solved", afaik."
++ More than that. We have over 1000 perfect games with no errors from the ICCF WC Finals.

Weakly solved means that for the initial position a strategy has been determined
to achieve the game-theoretic value against any opposition.

A strategy for the initial position to achieve the game-theoretic value of a draw against any opposition from white is to follow an ICCF WC Finals drawn game for as long as possible and as soon as white deviates to switch to the exhaustive analysis of said ICCF game.

So the problem boils down to analysing the > 1000 ICCF WC Finals draws
towards the 7-men endgame table base.

MARattigan
Sylvester_P_Smythe2 wrote:
MARattigan wrote:
Sylvester_P_Smythe2  wrote:
 

The above determines the theoretical answer to this question.

Wouldn't this do just as well?

or this perhaps?

 

Nope.

Because unlike the two positions you showed, the One I composed, is not shown yet, to be an automatic Draw.

Nice try though, Troll!

THREAD K*LLER.

Ah, yes. Now you explain it, it makes sense.

But I think the answer is then just a double application of your remarkably original method of proof.

This is obviously a draw.

If only one file determines a draw, then, by your method, a set up with all the files shouldn't make any difference.

So this is also a draw.

And as you remarked; 

"If only all Pawns for both sides determines a win for White or Black or Both Sides, then a set up with all the pieces shouldn't make any difference."

So chess is solved. It's a draw.

(I've assumed "a win for Both Sides" means the same as "a draw".)

 

Sylvester_P_Smythe2

Hello Sir,

If The Only Pawns Game, end in a Win or Loss for one of the Sides, Or a Draw...

Then no maneuvering with the Pieces, even with the skills possessed by Capablanca should change this result.