Author: David Rasmussen
Date: 08:47:53 12/29/05
Go up one level in this thread
On December 29, 2005 at 08:57:26, Ricardo Gibert wrote: > >Bruce Moreland discusses it here: >http://www.brucemo.com/compchess/programming/movetable.htm Unless I am becoming (even more) insane, there are a few errors in his example code. The first three entries of the argmtBD5[] array should contain the squares e6, f7 and g8, Not e6, d7 and f8. And the pmtBlocked pointer is not correct in all cases in that array either. But the idea is clear enough. It is very hard to assess what representation is fastest, overall, on a given platform (hardware, compiler, interpreter etc.), without implementing and measuring. /David
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.