Author: Gian-Carlo Pascutto
Date: 09:38:13 06/27/02
Go up one level in this thread
On June 27, 2002 at 11:40:00, Robert Hyatt wrote: >Then it depends on your definition of "bitboard program". IE, for me, >a bitboard program uses bitboards. A non-bitboard program does not... > >Maybe we should say "full bitboard" vs "partial bitboard"... I see the difference in whether you need to update those bitboards in make/unmake. After all, that is the point where you get a performance penalty for using them! If bitboards came without this penalty, you would be able to use them whenever you can make the operation you're doing faster in bitboards. I'd be a no-brainer to use them. However, this is not the case, and you need to 'bet' that you will be able to recover the penalty you incur because of this make/unmake updates, in other parts of the program. This will influence every decision you make in the rest of your engine. For the given eval example, this is not true. It can be used regardless of what is used in the rest of the program. -- GCP
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.