#2890
"@tygxc needs his claim to be 100% reliable for it to be part of something close to a proof"
++ No, there are 2 different things:
1) weakly solving chess, and
2) assessing the feasibility of weakly solving chess.
Before embarking on 1) it is necessary to do 2) first.
1) must be 100% reliable, or more exactly no more than 1 / 10^20 unreliable.
It must be as reliable as the weak solutions of Checkers or Losing Chess.
2) does not need to be 100% reliable. An order of magnitude is enough.
If it is 5 years or 4 years or 6 years does not matter.
500 years of 5000 years makes a difference in feasibility.
Schaeffer originally projected to investigate 10^9 positions to weakly solve Checkers in his elder paper and ended up with 10^7 * 10^7 = 10^14 after it was done.
@Elroch made another good point there - with this argument:
" If they assume queening, they may get to the position expecting a draw and then lose."
He explained it carefully.
Its one of many refutations of the '5 years' arguments.
One could argue endlessly over the semantics of 'refutation' though.
As to what @tygxc can/will do about that ... I guess there'll just be more sidestepping.
Didn't explain it particularly clearly,
It was clear enough for several people. I (genuinely) welcome questions if it was not clear enough for you.
though and it is not a refutation, in itself, of the 5 years argument.
The true relevance is that it means one of @tygxc's attempts to make the problem smaller and thus possibly accessible "in five years" (based on a rash guess about ignoring large classes of positions) is unreliable.
Just "unreliable" suffices in this case, since @tygxc needs his claim to be 100% reliable for it to be part of something close to a proof.
There's another issue there -

and that is - could it be 'proved' that something could be solved ... without actually solving whatever it is ?
Depends on what the thing is - and what definition of 'solved' has been proposed or assigned somehow.
Example: say an equation hasn't been solved - with only one unknown variable.
Extreme simple case: A quadratic equation.
If the general case has been proven algebraically - do we have to go ahead and solve a relevant equation that has known coefficients - to prove it could be solved?
No. That's neither extrapolation nor induction I believe.
Its simple straight objective mathematical logic and proof.
Which in turn means 'Yes'. Some things can be known or proven to be solvable - without actually solving them.
In fact - there are Infinite sets of such things.
If one really did have a legitimate proof that chess could be solved in five years - then what would some legitimate proofs look like? Real proofs.
In other words - not 'taking the square root' of a 40 digit number and other non-proving things.
Not doing those things.
So far - I don't think anyone has come up yet with what a real mathematical proof regarding the forum topic might even look like.
Hypothetically that is.
But that could be because nobody here has tried that yet.
But that might happen. Attempts to do that.
That and other things might take the forum well past the 3000 post mark - including not counting a particular person's unimportant disapproval of discussions here that he does not control and has not been able to prevent.
Maybe the more he 'disapproves' of others posting here - the more postings there have been ? Regardless - the discussions continue.
Anyway - and to get on with it ...
what would a real proof look like?
It would have to refer to the hardware speed of the computers involved - but in clear math fashion .. no dancing around 'nodes' and 'consider'.
And in addition to real proof - there could be proofs of things relevant too. Or instead.
And what those proofs might look like. Hypothetically.