> On 12-aug-08, at 10:40, Gian-Carlo Pascutto wrote: > > Well... no. Because if you have a perfectly ordered tree, in theory, > you don't need to search at all.
You need to search it to *prove* that it's perfectly ordered :-) -- GCP _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
