There are many tests of normality that might be well suited. The Kolmogorov-Smirnov test (http://en.wikipedia.org/wiki/Kolmogorov%E2%80%93Smirnov_test) for instance should be easy to compute in terms of the function erf().
None of those are good tests for the specific requirement here. To begin with, even when the graph looks Gaussian, I don't think it is. Moreover, Shapiro-Wilk will "look" somewhat more at the tails, and that's not interesting: We want to focus on the multimodularity. So just count the number and depths of peaks. I could suggest a few simple and quick algorithms that would be robust to the noise, but I think your methods will be as good as mine. Jonas _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
