Author: José Carlos
Date: 11:42:11 11/14/02
Go up one level in this thread
On November 14, 2002 at 13:33:26, Russell Reagan wrote: >On November 14, 2002 at 11:04:42, José Carlos wrote: > > >> It's a completely new engine written from scratch, just for the fun of >>experiencing new things. It uses non-rotated bitboards and MTD(f). Actually, my >>personal versions of both :) > >How do you handle things like rook file attacks with your non-rotated bitboards? >In other words, what do you do instead of using rotated bitboards? Do you use >the Kogge-Stone algorithms? > >Russell No. I compute a "between" bitboard and then check whether there's a piece between or not for every possible rook attack. It's not very smart, but avoids complexity and, when I want to learn about something I always go for the easy way first, trying to figure out everything myself. Later, I'll try more sophisticated methods, but only when I'm totally sure what's going on. José C.
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.