Zach, I can't help the windowsiness, but thanks for taking a look already. Popcounting I believe to be optimal for 32-bit only instructions, especially since I would like to keep the intermediate byte-count to help speed up the random pick function. There is a really neat trick to speed up the final accumulations, but I couldn't find the sse2 instructions to implement it. Bitscanning is indeed awkward the way I implemented it, but I didn't see a better way to do it as there is no compare instruction that yields a boolean as the result. I would be interested to see what you come up with for shifting, I believe that this is where a lot of time is spend.
René On Tue, Aug 25, 2009 at 6:20 PM, Zach Wegner <zweg...@gmail.com> wrote: > On an initial look, it seems that the shifting, popcounting, and > bitscanning functions can be improved significantly. That's all I > looked at closely, perhaps the other board routines could use some > reworking too. > > I'll try my hand at optimizing it if I get the time, but the windowsy > code makes it a bit difficult. > > Zach > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ >
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
