Author: Russell Reagan
Date: 14:23:43 06/14/03
Go up one level in this thread
On June 14, 2003 at 17:11:11, JW de Kort wrote: >Also i'am thinking of implementing attack tables in my 0x88 program but i have >not found a fast approach. Ant tips?> I think the fastest way of doing attack detection in 0x88 is probably the one described by Bruce Moreland (http://www.brucemo.com). You can look at his open source program Gerbil to see a working example of how he does it. Of course there might be small tweaks you can do to speed it up, but that concept is the fastest I know of. Anytime I've tried to implement real attack tables, it's always been slower than the on-the-fly detection (whether 0x88, bitboards, 16x16, whatever). YMMV.
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.