Author: Russell Reagan
Date: 22:50:49 11/27/02
Go up one level in this thread
On November 27, 2002 at 19:03:38, José Carlos wrote: > The program is still far from playing a whole game, and I'm not gonna have any >spare time in the next few months, but I expect it to outplay Averno completely >(though I'm having a horrible branching factor with MTD). Hello José, I too am writing a bitboard engine, and mine is also using non-rotated bitboards. I'm almost done with move generation (still need promotion and en passant). How fast is your non-rotated bitboards program compared to other programs? I know that Gerd said IsiChess is a little faster when using his MMX implementation of non-rotated bitboards, but I'm only using a C/C++ implementation of those routines, and I'm afraid that once I get it all finished that it's going to be fairly slow. What do you think? I have a lot of functions I can inline also, so that might give me a boost. Currently I don't have any functions inlined. Once all of the attack generation and bit location lookup (which gets called a lot) gets inlined, that could be significant, but I don't know how much inlining usually helps. I'm also passing bitboards to those functions by value, so inlining can help there too. Does anyone know how much inlining can help? Russell
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.