>> distance=C.(dx+dy+max(dx,dy)) > I'm calling this "the gridcular metric", ... > ... > Most programs relying on gamma-pattern combinations are probably using > this; at least Pachi is for sure, CrazyStone and others apparently too.
Why is it good in those algorithms? Simple manhatten distance: X 1 2 3 4 1 2 3 4 2 3 4 3 4 4 Adding in the max(dx,dy): X 2 4 6 8 2 3 5 7 4 5 6 6 7 8 I.e. it makes the diagonal directions more important, compared to moves in a straight line. I like what it has done to the "3" row: made keima slightly more important than 2-ken-tobi. But what it has done to the "4" row seems less useful. Go knowledge has names for 3-ken-tobi and o-geima, but I don't think there is any name for the two-step diagonal. I took this to mean it is a less important relationship between stones. Darren _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
