- Let the board be a square on a Cartesian plane
- Let N be the length of of the square's edge
|Table of contents
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.