Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Rough comparison between rotated bitboards and 0x88

Author: Larry Griffiths

Date: 14:54:29 06/20/00

Go up one level in this thread


On June 20, 2000 at 12:18:06, Ralf Elvsén wrote:

>I'm asking about things I don't have much personal experience from
>so forgive me if this is a stupid question. With BB, as I understand
>it, one usually have a lot of precomputed BB-arrays, like bishopsMoves[square],
>maybe blocks[from][to]  or the rotated BB-stuff. Is this causing problems
>for the cache? How much precomputed stuff is needed in 0x88 compared to this?
>
>Ralf

Ralf,

I did experience slowdowns in my program due the precomputed bitboard arrays.
You can go as crazy as you like creating all sorts of wonderful neat-o bitboard
arrays consuming several megabytes of storage.  Been there, done that, pruned
the bitboard stuff back :)

I also pre-computed RookMoves (file and rank) using bitboards (WITHOUT USING A
LOOP BY THE WAY).

Larry.



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.