Author: Matthias Gemuh
Date: 12:36:53 03/27/02
Go up one level in this thread
On March 27, 2002 at 15:25:12, Matthias Gemuh wrote: >On March 27, 2002 at 13:29:46, Alvaro Jose Povoa Cardoso wrote: > >>Could you please explain your scheme? >>How do you compute the rooks and bishops attacks? >>Do you use the Alessandro Damiani algorithms? >>If not, could you explain what you do in some detail? >> >>All I have done so far was a checkers engine. >>I'm in the process of determine a reasonable aproach of speed but without the >>complexity of rotated bitboards (particularly the 45ยบ ones for bishops) >> >>Best regards, >>Alvaro Cardoso > > >I use an idea from famous Dr. Hyatt. >Precompute squares which could obstruct a sliding piece from moving from "nFrom" >to "nTo" and store results in 64x64 matrix of bitboards (in chess). >An "AND" operation of matrix element (nFrom,nTo) and bitboard "all occupied >squares" yielding 0 means the road is free. Attack ! > >Regards, >Matthias. "Attack !" is of course not quite correct if there is no enemy on "nTo".
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.