Author: Alessandro Damiani
Date: 02:16:57 02/03/00
Go up one level in this thread
On February 02, 2000 at 21:57:27, Michael Neish wrote: > >Excuse me if I gripe. I just spent two months converting my program to >bitboards and when I finally removed all the obvious bugs I find it's searching >about 30% slower than the original routine, which just used simple arrays and >loops to generate moves, a la TCSP. > >So where does the magic of bitboards come alive? It's certainly not in my case. > >Cheers, > >Mike. Hi Mike, First of all you have to think in bitboards. Bitboards are sets. Think in sets! The FirstOne/LastOne function is the problem of the bitboard data structure. Try to avoid it whenever you can. In Fortress I detect passed pawns incrementally (bitboards!), evaluate all pawns without scanning them (bitboards!),... Currently I am improving the full-width search of Fortress by exploiting more properties of bitboards. Al
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.