Author: Pham Minh Tri
Date: 03:32:53 10/16/00
I know that Bitboard makes move generation the fastest, but this structure is also one of the most complicated. However, an old post said that the generation function is not the key of success to chess program and the author illustrated that after his optimality (which made that function work much faster), the speed of system increased only 1 percent. As a result, my question is: is bitboard really worthy for implementation when it takes a long time to program and more time to fix all bugs (maybe several times bigger than the rest of program)? Or is it better if we use this time to concentrate on hash table, null move threshold and so on? I plan that I will forget the bitboard (at least in the first period) if it help me only few percent. Pham
This page took 0.01 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.