Chess will never be solved, here's why

Sort:
Avatar of MARattigan
Elroch wrote:

I think your last sentence is correct, @MARattigan!  

...

Now I see what you're saying.

Your previous posts didn't mention "one response for black that you can prove forces a draw", only "one move", so I somehow picked up that after 1.a4 it would be sufficient to look at 1...a5 and say, "OK dealt with that".

Avatar of playerafar
Elroch wrote:
playerafar wrote:

Continuing with my idea (instead of being baited by whoever) -
instead of going by candidate number of moves (ridiculous when you consider how many candidates there might be - and how comparable they might be too)
- go by computer evaluation number instead.
Would it work?  I'm not saying it would or would not work.
I'm suggesting its worth some discussion.
I recall from the days when I played postal chess (several decades ago) -
I'd make written lists of all the legal moves available for my move.
Then - I'd make three columns:  They were 
Candidates (sometimes ten or more) - intermediate -
and - too obviously losing or inferior.

Then I'd start calculating and comparing the candidates -
but sometimes there was a snag - and it turned out that some or all of them were pseudo-candidates ...
at that point - the real candidates had to be found and compared from the intermediate list along with 'survivors' from the first list.
At no time did any move ever emerge from the 'ridiculous' list.  

Point:  computers would be very good at such lists.
Issue - the computer may on occasion be able to isolate one move - for example the opponent plays QxQ.  Now is there a big percentage of the time where you can justify any other move but the only Recapture ??
The computer would know when you could or couldn't.
Anytime an opponent takes a piece of your's - a big percentage of the time you're taking back.
Point:  its pruned down to just one move in many instances.

And:  Would it be rare that the computer would have 20 comparable candidate moves?  
1) a4 should stay in.   But e4 e5 Ba6??   In weak solving I'd say its reasonable to knock that out.  Much much More Reasonable than only having four candidate moves ...  which is numb and arbitrary.

No-one can generate a general rule and know it is reliable. Passive-looking sacrifices can be best moves. That the position after 1.e4 e5 2. Ba6 Nxa6 is probably enough to win there is not knowledge, just (very likely good) judgement.

 

Yes - and bxa6 is probably winning too.  Although computers might rate Nxa6 much higher.
Point:  'Weak solving' as opposed to 'solving'.

Avatar of MARattigan

Doesn't look drawing at any rate - but you never know.

Avatar of playerafar

@MARattigan 
I tried the button and White is lost.

But regarding as to when we can dismiss a move for 'weak solving' purposes' ...  there's some 'big problems'  happy.png
Say one move was +2 and another -2 at the same point in the game with the same player to move.
The minus 2 can't be discarded - because it is not 'losing' ....
Lol !    happy.pngevil.pnggrin.pngblitz.pnggold.pngdiamond.png

Avatar of playerafar

And - running that analysis button - which is Stockfish I believe (I don't know what version) 
then bxa6 isn't rated that far below Nxa6. 
(after giving it 30 seconds or so)
An advantage of over four points for black. 
But less than a point between the two takings of the bishop.

Next point:  Is a difference in evaluation of 4 points more than enough to dismiss a move (or to dismiss a candidate move for the opponent?)  ?
Could be.
Especially if the 'spread' is close to zero?
Say +2 versus -2.
But if one move was +12 and the other was +8 ... should the +8 be dismissed?  I'm thinking no.
Some would say "At +8 its 'over' anyway - no need to 'solve' further - so no worries about the +12 instead"
Which brings on another idea - anytime the evaluation for a move hits a certain plus number - then look for 'final time' on that move.
Same where all choices are too negative.  Its considered lost.
I would say even +6  (or minus 6) is Crushing. 
If that's the best move available.
But then there's a Nasty hitch ...  somebody has +6 available but plays a plus 3 instead.  Could we 'dismiss' the plus 3 ?  How?  It doesn't lose.

Avatar of MARattigan

@playerafar

Try the analysis button here.

White to play and draw

 

Avatar of playerafar


Hi Martin !
I answered your post but my reply refused to post !
I'll try this one now - and if that works - edit it maybe.

@MARattigan - the analysis button in your diagram indicated that white is Lost.

But now - there's a big 'problem' with 'dismissing moves'.
Say at any point in a game - with the same player to move - (computer vs computer) the top choice is +2 and the next one down is -2 ...
then can the minus 2 and below be 'dismissed' ?
It starts to look like No.  Because minus 2 isn't necessarily Losing !  
happy.pnggrin.pngevil.pngblitz.pnggold.pngdiamond.png

Avatar of MARattigan

@playerafar

Point is it indicated wrong.

Avatar of playerafar
MARattigan wrote:

@playerafar

Point is it indicated wrong.

You mean white can draw ??  happy.png
I guess I better look at your diagram some more.

Avatar of playerafar
MARattigan wrote:

@playerafar

Point is it indicated wrong.

I think I get it - White's King just runs down to a1 and 'hangs out' there.
Doesn't shave.  Shirtless.  And ...
Great one Martin !
Several points arise from that.  
One could be that Nxa6 could be Much better than bxa6 in the Ba6 thing ?

Avatar of playerafar
MARattigan wrote:

@playerafar

Well, I can't see any way he can win.

I tried some moves. 
Black can try to cut off b2 but then white just steps over and wins that pawn.
But it looks like there's a really Nasty Flaw in the engine there.
Because when I click on lines that have the White King shuttling between a1 and b2 - the engine Refuses to assign 0.00  !!
I wonder if chess.com is aware of the Bug ....
Am I certain that white draws this ?
Not 100%.
I don't see how black stops white from bouncing a1 to b2.

Avatar of MARattigan

Main point is SF's numbers prove nothing.

Avatar of playerafar
MARattigan wrote:

Main point is SF's numbers prove nothing.

I used chess.com SF just for example.
The project engines would be better ...
If you're saying 'weakly solving' requires 'proof' ...  well that's relevant.
But 'weakly solving' could have multiple definitions ...

Avatar of MARattigan

If you look back at the posts it does, but a proof is always required.

But you just pointed out a flaw in the definition I posted earlier. It should read:

A (timely) weak solution means that for the initial position either a proven (timely) strategy has been determined for one player that achieves a win for that player against any opposition, or a proven (timely) strategy has been determined for each player that avoids a loss for that player against any opposition. 

Edit: Modified the wording to make it explicit that the result of a strategy refers to the result for the player to whom the strategy applies.

Avatar of playerafar
MARattigan wrote:

If you look back at the posts it does, but a proof is always required.

But you just pointed out a flaw in the definition I posted earlier. It should read:

A (timely) weak solution means that for the initial position either a proven (timely) strategy has been determined for one player that achieves a win against any opposition, or a proven (timely) strategy has been determined for both players that avoids a loss against any opposition. 

That's a nice definition.  I appreciate that.
Care to qualify how it would differ from 'strongly solving'?
Yes I realize that's probably been done multiple times in the forum -
but this would be a good place.
And our posts crossed - so I'll bump my other post to a bit later.

Avatar of playerafar

The overall discussion doesn't have to be 'airtight solving' -
it seems to be well established that's gazillions of millenia away ...
unless there's big improvements to the software and hardware.

But then there's other related things.
'Weak solving' has been looked at for 2000 posts or so.
What about -
Will all possible legal chess positions ever be Categorized ?
Some could reply:
"Already done" - every position is either 'solved' or it isn't.
But that's always been true.
Maybe the percentage of 'truly solved' positions so far - is known.
So maybe there'll be estimates of how long to improve that percentage by how much.
In other words - a graph.  

Avatar of MARattigan
playerafar wrote:

The overall discussion doesn't have to be 'airtight solving' -
it seems to be well established that's gazillions of millenia away ...
unless there's big improvements to the software and hardware.
...

Well established, yes, but not to all.

The overall discussion is clouded by people contributing without realising what solving means.  If it's not airtight it's not a solution.

@tygxc is planning to spend the next quintillion years getting several supercomputers to not solve chess.

Avatar of playerafar
MARattigan wrote:
playerafar wrote:

The overall discussion doesn't have to be 'airtight solving' -
it seems to be well established that's gazillions of millenia away ...
unless there's big improvements to the software and hardware.
...

Well established, yes, but not to all.

The overall discussion is clouded by people contributing without realising what solving means.  If it's not airtight it's not a solution.

@tygxc is planning to spend the next quintillion years getting several supercomputers to not solve chess.

Lol !   Hahahahhahahaha
Regarding your great position with white drawing by running his lone King to a1 ... even though SF keeps stubbornly assigning it as lost for white even after advancing the moves ...
Well if you don't mind the pun ...
that position you've posted ... is a1 !!! happy.png

Avatar of playerafar

There's people in various clubs who might like seeing that one.
And - I wonder if the staff know about it.

Avatar of MARattigan
playerafar wrote:
MARattigan wrote:

If you look back at the posts it does, but a proof is always required.

But you just pointed out a flaw in the definition I posted earlier. It should read:

A (timely) weak solution means that for the initial position either a proven (timely) strategy has been determined for one player that achieves a win against any opposition, or a proven (timely) strategy has been determined for both players that avoids a loss against any opposition. 

That's a nice definition.  I appreciate that.
Care to qualify how it would differ from 'strongly solving'?
Yes I realize that's probably been done multiple times in the forum -
but this would be a good place.
And our posts crossed - so I'll bump my other post to a bit later.

A (timely) strong solution means that for all legal positions either a proven (timely) strategy has been determined for one player that achieves a win for that player against any opposition, or a proven (timely) strategy has been determined for each player that avoids a loss for that player against any opposition. 

Edit: Modified the wording to make it explicit that the result of a strategy refers to the result for the player to whom the strategy applies.