Author: Reinhard Scharnagl
Date: 10:36:15 12/03/04
Go up one level in this thread
I am convinced that a good compiler always will translate a "x % (2^n)" term into "x & (2^n-1)", so it would be hard to program the difference. (Check it with a disassembler). Reinhard.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.