Hello!

I'm writing code relating to combinatorial game theory (in the style
of Berlekamp, Conway, and Guy's Winning Ways) in GAP. Has anyone out
there been down this road already? In particular, in C one may use "^"
for binary addition without carrying (Nim addition), an operation used
repeatedly (and recursively, so time is a BIG issue) and pervasively
in game theory calculations. Is there a quick way to do this in GAP?
By "quick", I mean faster than computing the binary expression, doing
the addition without carry term by term, and then converting back to a
Gap integer.

To head off questions about just using C, I'm looking at several games
which take place on Cayley-Digraph's, so I need (want?) the group
algorithms handy.

Thanks in advance,
Kevin O'Bryant