[computer-go] Once and only once

[Tom Cooper <t.cooper@xxxxxxxxxxxxxx>]

Is there a consensus on list about whether tree search code should be 
written 'once and only once' abstractly, or should it be duplicated and 
written concretely, once for a black node and once for a white node?  Or 
should one make an ad hoc decision, based on the nature of the search?


_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/