Bill Spight wrote:Let's suppose that you have a position where you can move to a local count of G with gote or S with sente, and the your opponent can move to a local count of R with gote, and G > S > R (from your perspective).
Just looking at the local position, compare S with (G + R)/2. If the position is gote, then its count is (G + R)/2, and if it is sente its count is S. If S > (G + R)/2 then it is sente, if S < (G + R)/2 it is gote, and if S = (G + R)/2 it is ambiguous
While I admire the elegance of these conditions because of their independence of move values, the gote / sente unequations are wrong. The conditions 1 below are correct, according to the proofs below.
Consider a local endgame and a player, here Black, having a gote sequence resulting in the count G or a sente sequence resulting in the count S and the opponent having a gote (or reverse sente) sequence resulting in the count R.
Conditions 1:
The local endgame is
a local gote if S > (G + R) / 2,
Black's local sente if S < (G + R) / 2,
ambiguous if S = (G + R) / 2.
The initial position's tentative 'gote' move value is MA = (G - R) / 2.
With GB and GW being the counts of G's followers, we have
S = GW, // From the initial position, Black moves to G, then White moves to GW.
the count G = (GB + GW) / 2,
the move value MG = (GB - GW) / 2.
The following conditions define local gote or sente according to de-/increasing move values.
Conditions 2:
The local endgame of the initial position is
a local gote if MA > MG, // decreasing tentative 'gote' move values
Black's local sente if MA < MG, // increasing tentative 'gote' move values
ambiguous if MA = MG.
Proof of equivalence of the "ambiguous" conditions 1 and 2:
MA = MG <=> (G - R) / 2 = (GB - GW) / 2 <=> G - R = GB - GW <=>(*1) G - R = (2G - GW) - GW <=> G - R = 2G - 2GW <=> -G - R = -2GW <=> G + R = 2GW <=> (G + R) / 2 = GW <=> (G + R) / 2 = S.
Proof of equivalence of the "gote" conditions 1 and 2:
MA > MG <=> (G - R) / 2 > (GB - GW) / 2 <=> G - R > GB - GW <=>(*1) G - R > (2G - GW) - GW <=> G - R > 2G - 2GW <=> -G - R > -2GW <=>(*2) G + R < 2GW <=> (G + R) / 2 < GW <=> (G + R) / 2 < S.
Proof of equivalence of the "sente" conditions 1 and 2:
MA < MG <=> (G - R) / 2 < (GB - GW) / 2 <=> G - R < GB - GW <=>(*1) G - R < (2G - GW) - GW <=> G - R < 2G - 2GW <=> -G - R < -2GW <=>(*2) G + R > 2GW <=> (G + R) / 2 > GW <=> (G + R) / 2 > S.
(*1) This transformation is possible because of G = (GB + GW) / 2 <=> 2G = GB + GW <=> 2G - GW = GB.
(*2) Multiplication by -1 inverts the unequality sign, as can be seen in this example transformation: 2 < 3 <=> -2 > -3.
Note:
If the local endgame is sente, we replace the tentative 'gote' count (G + R) / 2 and tentative 'gote' move value (G - R) / 2 by the sente count S and sente move value S - R.