Post by BillPost by Detlef MüllerHi,
recently a go player suggested finding out the "adequate
komi" using a fairly strong computer program (i.e. playing
many games against itself with increasing komi until win rate
exceeds 50%).
Is this already explored by someone (and if so: does the
outcome differ much for different programs)?
[...]
Post by BillIt seems intutitive that the stronger the program the higher the value
of the komi. To help validate this, consider beginning players where
the value of komi is about 0.
Mh, this contradicts my intuition.
I'd expect a greater mean variation of the results (meaning the
territorial difference at the End of the game) for weaker
players, sure.
But my ituition would say that (after lots of games) in average the
wins and losses caused by big errors should even out.
(I agree that this is no reason to bother newcommers with the
Idea of komi - their strength changes too fast, so "the probably
stronger one gets white" might be the best advice).
The good news ist: this can nowadays simply checked out using
the suggestion of the afore mentioned go player (as the strength
of [even weak] go programs does not change, assuming no learning
from game to game is implemented).
If different algorithms fight each other, it might be that one
of them is iferior realizing a big komi (maybe a montecarlo
algh. could play too lax starting with biger komi).
If this method leads to different komis dependent on the
programs (playing itself), this would be interesting (especially
for programmers).
Greetings,
Detlef
--
Dr. Detlef Müller,
http://www.mathe-doktor.de oder http://mathe-doktor.de