game length is unrelated to difficulty. there are 19 move games with uncomputable winning strategies, and it's easy to create games of any length whose perfect strategy is easily computable (in logspace, and linear time, say).
i think that using log(max_elo-min_elo) is a pretty fair way to do it, for real-world games between real people. not sure what to do with computer players whose only competition is other computer players -- computer-player-only elo seems unfair to compare to human-player-only elo. s. _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
