Author: Daniel Clausen
Date: 16:03:38 05/27/02
Go up one level in this thread
On May 27, 2002 at 18:00:25, Vincent Diepeveen wrote: >I just show one example here. If you say: "i don't need the number of >attackers, my program is doing without that information fine" > >Then i accept that statement of course, like i did a year ago. >It just means that bitboards are unusable if one desires to use more >information for a chess engine. No, it merely means that bitboards are probably not the best data structure to store stuff like Diep does. It's very well possible that that are many things which can also be used in a very good way for the eval, but where bitboard is faster than 0x88, mailbox, you name it. The art is not to choose 'the right data structure' here. The art is to use the advantages a particular data structure offers. IMHO, of course. YMMV. Sargon
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.