RE: [computer-go] Pattern Matcher

["Mark Boon" <tesuji@xxxxxxxxx>]

> -----Original Message-----
> From: computer-go-bounces@xxxxxxxxxxxxxxxxx
> [mailto:computer-go-bounces@xxxxxxxxxxxxxxxxx]On Behalf Of Frank de Groot
> Sent: Tuesday, November 09, 2004 11:49
> To: computer-go
> Subject: Re: [computer-go] Pattern Matcher
>
>
> From: "John Tromp" <John.Tromp@xxxxxxxxxxxxxxxxx>
> Subject: Re: [computer-go] Pattern Matcher
>
>
>
> > It uses 2 modulo operations per lookup.
> >
> > > modulo and divide are like a 46+ cycles at opteron, and like
> 200 cycles
> or
> > > so at a P4?
> >
> > What can I say, P4s suck:-(
>
>
> Why don't you use an AND?
> Vincent already mentioned that.
> A simple AND is the same as a modulo, n'est-ce pas?

Yes. Provided you use a power of two. But the speedup should show both in C
and in Java. If anything I'd think it would close the performance gap rather
than making it bigger. Maybe worth a try.

>
> _______________________________________________
> computer-go mailing list
> computer-go@xxxxxxxxxxxxxxxxx
> http://www.computer-go.org/mailman/listinfo/computer-go/
>

_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/