Author: Russell Reagan
Date: 20:52:36 06/14/03
Go up one level in this thread
On June 14, 2003 at 18:59:16, Sune Fischer wrote: >Goes without saying if you only use it for incheck. >Incheck can be done by incrementally checking only for the moving piece and the >piece it may uncover (x-ray). No attack table can beat that. I never thought of this. How would you do that? Use either a 64 x 64 array, or the 256 element array (like the 0x88 attack array) to determine if a piece that moved from a square could have exposed the king to check? Makes sense. I wonder how this would compare to the illegal move detection of allowing the king to be captured and taking back the moves. >I think if you don't have attack tables you will end up going through hoops to >avoid the expensive attack calls, just look at the grief over a simple incheck >:) I like Gerd's and Steffan's method of using the bitboard filling routines. Of course, you have to write them in MMX assembler and be careful how you use them, or your program crawls. When Opteron gets more compiler support those routines will fly, I think.
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.