On Tue, 2009-07-07 at 17:09 +0100, Christian Nentwich wrote: > [..] Unless you can, in the end, show that your algorithm can > outperform another one with the same time limit, you have not proved > that it is an advance. That is why tournaments are played with time > limits, not limits on the number of playouts. Time is an important > dimension of the game of Go.
This is somewhat funny: normally, it is Don who argues along these lines.. ;-) Hellwig _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
