> is dynamic komi not also usefull for > > - early pass, (only play if a move is better than a pass)
Maybe, as you can define "better move" by "there is a dynkomi x where one loses while the other wins". But you'd need O(log(x_max)) runs to find it out. > - preventing horizon effect. (pushing losses over the search horizon) > (not so sure about this but MTSC/ utc doesn't seem to prevent it on > its own, what i find s bit puzelling on its self) I don't know how to do this - do you have a concrete idea? > -strong play in lost games. preventing braindead moves > (even if the game is lost the program can still play strong, just > adjust the komi so that some moves are better than others) > resignation can than be defined as points behind. (resign if more > than 5 points behind but keep playing if 1-4 points behind) > > -strongest play at won positions, (if all moves lead to a win, dynamic > komi can decide what is the best move) Definitely. > - whole number komi. > for player just play like the komi higher (for white) or lower (for > black) so for the program a dfraw become a win for the player. > (but even then a win is better than a draw, so it is all a bit > fidely but whith the progress on the 9x9 front, when solving small > board go comes into view the problems around whole number komi needs > addresing. "If all moves lose with -0.5 dynkomi, play the best move at +0.5 dynkomi", so yes. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
