On Dec 19, 2007 12:25 PM, Chris Fant <[EMAIL PROTECTED]> wrote: > > The basic idea is this: 90 degree rotation (to the right) is represented > as > > a circular shift (to the right) by 1/4 of the key length. mirroring the > > board (swap left and right) is done as reversing the order of the bits > in > > the key. > > > > Distinct hash values around the board would have to share the same > rules. > > > > Points on lines of symmetry (such as C3 with 4 equivalent points or the > > unique tengen) need more care with how they're selected). > > That's the same system I used in my first Go program, and it appears > to also be the same as what is in the paper that Remi linked. I > didn't use it for full-board hashes, I used it for patterns.
Looking very quickly at the paper Remi gave, I think they swap nibbles in each byte rather than all the bits. That may be computationally simpler
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
