yes basically i'm gone from this thread unless i see something overly negative about me.
and i'll going back to weekly or halfmonthly checks, mainly out of curiosity
in this respect, mr Kobra wrote:
the Lemma is *wrong*.
because it wouldn't converge to minimax ?
hmm that still doesn't say it's not sufficient to find a winning strategy if there would be one. No i haven't *proven* that
because i still haven't figured out a clear definition of 'winning strategy' in the Zermelo theorem
Happy now ?
Second, regarding minimax, we have the Chinese database, that clear *is* minimax, and also there we don't find any
winning strategy. And as with judicial evidence in the discipline of law (not pure math, i admit), cumulative
evidence is making a claim stronger, obviously (as towforce also already suggested; for more info i would refer to a book like this
https://assets.cambridge.org/97805216/7 ... matter.pdf|
Quite relevant in this respect is the socalled Daubert standard
https://en.wikipedia.org/wiki/Daubert_standard
More boring stuff: assume 1) the term solving in ultraweakly solving (like in weakly and strongly solving)
would need a rigorous proof, (which i strongly doubt in the situation of ultraweakly solving),
but 2) the term solved in the statement 'essentially solved' (beyond resonable doubt) does *not* require a rigorous proof,
as i can derive from the suggestion by syzyg to use such words (as essentially solved, ie determined it's a draw).
but that's a *contradiction* !
Yyes i like proofs by contradiction, as you may have noticed

So maybe indeed the word 'solving' in ultraweakly solving does not need a *rigorous* proof. Despite the term
Lemma maybe being incorrect (i'll do some more homework). Yes this become boring now isn't it.
But more of this reasoning may later appear anyway in the thread 'chess is a draw' (i.e. not here,
also because reasoning via two different threads may become confusing)
happy further chatting (but no slander plsz) and
Happy 2024