On 2/12/07, Phil G <[EMAIL PROTECTED]> wrote:
For those doing a lot of bit logic in their computer go programs, you might
be interested in this collection of highly optimized methods for doing
things with "bits"
(like counting bits sets in parallel and computing the minmum or maximin of
two integers without branching):
http://graphics.stanford.edu/~seander/bithacks.html
Seen it before, but still a very nice site with lots of clever tricks.
I have some improved bit counters, if anyone is interested...
Erik
_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
