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
- Phil
"I hope I never run out of bits."
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
