Author: Russell Reagan
Date: 14:30:16 11/30/02
Go up one level in this thread
On November 29, 2002 at 19:19:02, Gerd Isenberg wrote: >int BitSearch_v2(BitBoard bb) >{ > __asm > { > bsf eax,[bb+4] > xor eax, 32 > bsf eax,[bb] > } >} Just out of curiosity, is it faster to do an 'xor' there than it is an 'add'?
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.