Early versions of Pebbles used that specific code. But I have also never seen it published, which suggests that maybe someone should actually do so.
I should point out that you can't really build a strong program on this basis. You will eventually want to know the 3x3 neighborhoods of every point, so removing points in bulk does not work well. The problem is that you have to incorporate knowledge in your program, and then bit-parallel systems stop providing sufficient context. To my surprise, when I wrote the code that tracked 3x3 neighborhoods, I was able to delete so many "look up, down, left, right" tests that Pebbles became faster. Best, Brian -----Original Message----- From: [email protected] [mailto:[email protected]] On Behalf Of Cameron Browne Sent: Saturday, May 24, 2014 5:45 AM To: [email protected] Subject: [Computer-go] Bitwise-parallel surround capture Hi, This draft paper describes a simple bitwise-parallel method for performing surround capture: http://www.cameronius.com/research/go-bits-1.pdf Before I submit it, I just wanted to check with this list that the method is not known and already in use. Any general comments on the paper would also be appreciated. Regards, Cameron _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
