• 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 occurred. 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.

KomiUpperBound last edited by on January 26, 2015 - 07:38
RecentChanges · StartingPoints · About
Edit page ·Search · Related · Page info · Latest diff
[Welcome to Sensei's Library!]
Search position
Page history
Latest page diff
Partner sites:
Go Teaching Ladder
Login / Prefs
Sensei's Library