Author: Uri Blass
Date: 14:47:24 08/23/03
Go up one level in this thread
On August 23, 2003 at 17:19:20, Sune Fischer wrote: >On August 23, 2003 at 16:24:28, Andrew Williams wrote: > >I know this scheme very well, perhaps we should compare nps ;) > >Do you also xor out the changes? > >One problem I see with this, is that 32 bits is too big to make use of SEE by >table lookups. I do not understand what table lookup you think about. Suppose that you could use table of 2^32 entries. How can it help you when you cannot know based only on the 32 bit number if the piece is attacked by a pawn or by a rook. There are no special bits for pawns and speical bits for knights. If you save in the bits the piecetype of the attackers and the number of the attackers of every type then you can do it but this is not 1 bit per piece. Uri
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.