[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [computer-go] Once and only once
On 5, Apr 2005, at 2:30 PM, Tom Cooper wrote:
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?
SlugGo has only one tree search code. It has evolved, but we have never
considered one for B and another for W.
I could imagine writing special purpose search codes, perhaps for
things like ladders, or eye killing/making moves, but SlugGo depends
upon GNU Go for things like that, so we do not have this concern right
now.
Cheers,
David
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/