Oops I only understand that you take into account trees likeRobertJasiek wrote:The context of each proof is the proposition and its presuppositions, possibly together with applied earlier axioms, definitions and propositions. The context is the task of assigning the correct count, move value, gains and type to a local endgame (of a certain class). Now that you have possibly understood it, what do you think of my proof? Is it - for its declared scope - correct? Can you appreciate the elegant constructions of proofs by contradiction? The case "b = w" is the most difficult and beautiful part. Bill, did you want me to rediscover its beauty or have you just overlooked it?
......A......
...../.\.....
..../...\....
...B.....C...
../.\.../.\..
.l...b.w...r.
I can try to undestand your proof but you have to help me because I have first to understand your notation.
Let's take the beginning:
Remarks
CGOTE is a gote count. CSENTE is a sente count. C is a white-count.
MGOTE is a gote move value. MB,SENTE is Black's sente move value.
MW,SENTE is White's sente move value. M is a tentative move value.
FB is Black's follow-up move value. FW is White's follow-up move
value.
PA is the position of the following game tree's node A etc.
[Proposition 11 and related propositions say that Black's local sente
is characterised by these equivalent, alternative value conditions:
CSENTE < CGOTE <=>
MGOTE < FB <=> MB,SENTE < FB <=> MB,SENTE < MGOTE.
What does mean CGOTE, CSENTE, MGOTE, MSENTE? Maybe:
CGOTE = (l+b)/2 ?
MGOTE = (l-b)/2 ?
CSENTE = b ?
MSENTE ?
As soon as I understand the notation I am sure I will be able to progress quickly through your proof.