KomiUpperBound

   
  • Let the board be a square on a Cartesian plane
  • Let N be the length of of the square's edge

Table of contents

N squared as a starting point

Arno: The proof for the upper bound goes something like this: if Black starts and White plays no move, Black can win by at most N squared points because no captures have occured. Thus the upper bound for komi is N squared, otherwise White would always win.

N squared is too high if white can always live

togo: There is a very easy way to lower the upper bound, Evand already presented it: Prove the possibility of a living group for White.


This is a copy of the living page "KomiUpperBound" at Sensei's Library.
(OC) 2012 the Authors, published under the OpenContent License V1.0.
[Welcome to Sensei's Library!]
StartingPoints
ReferenceSection
About