Perhaps this is also among the well-known material (or something
There have been discussions about handling symmetry in the past.
See for instance Heikki Levanto's group theoretic hashing paper.
For 'classic' (non MC) programs, board-symmetries were not important,
except for handling joseki/
On Tue, Sep 30, 2008 at 04:29:12PM +0200, A van Kessel wrote:
There have been discussions about handling symmetry in the past.
See for instance Heikki Levanto's group theoretic hashing paper.
I'm afraid you must have misattributed that - I don't know much about
hashing, less about group theory,
Oops I confused you with Antti Huima. No offense...
I meant:
http://fragrieu.free.fr/zobrist.pdf
Sorry,
AvK
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
Since statistics play such a vital role in modern Go engines, is there a
danger
that good old-fashioned low-level optimizations interfere with those
statistics?
Things like not re-evaluating symmetric positions (boar mirroring/rotation,
move transposition, etc.) multiple times interacting
