Your post is very interesting. The tail part of it seems mangled. On Wed, 2007-11-14 at 20:37 -0500, Eric Boesch wrote: > . Any coordinate is just a sequence of bits. Each bit can be encoded > separately. So the problem reduces to how to encode a single bit (0 or > 1) so that the sum of up to 4 values equals a given number (say 0) > only if the bit is equal each time. > > For bitmasking ease, you can use 3 bits per bit. Spread each input > number out like this: the > > Up to 4 times 1 (mod 0) equals 0 only if
_______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
