Author: Russell Reagan
Date: 10:14:55 06/01/02
Go up one level in this thread
On June 01, 2002 at 08:12:39, James Swafford wrote: >I'm curious, though - what do you need to rotate that you're not doing >incrementally in make()? Updating a rotated board incrementally takes >two table indexes and an xor. If you're not updating incrementally, >I'm guessing you're not using that bitboard in your move generator, so >what's up? :) > >Interesting. > >-- >James I'm not an expert on bitboards, but could he be doing something with evaluation? Is there any reason to choose this kind of method over an incremental approach if you are not doing move generation with it, but only evaluation? I recall Dan saying something about working on a hybrid program, using 0x88 and bitboards, where it has the ability to switch between the two in the middle of a search even. Perhaps that is what he is working on. Russell
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.