Author: Tord Romstad
Date: 03:56:35 04/07/04
Go up one level in this thread
On April 07, 2004 at 05:06:13, Gerd Isenberg wrote: >But caching/precalculation of rotated lookup that way only pays off, if you >really need it very, very oftern per node for a lot of squares. And most of the >time you really dont't need attacks from all squares... I apologize for asking a stupid newbie question (I started experimenting with bitboards less than a week ago): How can you avoid computing all attacks from all squares when evaluating a position? Tord
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.