Author: Andreas Guettinger
Date: 03:31:59 03/06/04
Go up one level in this thread
Exactly where I'm working right now. First, I had a piecelist[16] for each color. Then I changed to separate lists for each piece type. I was not happy with that, because it was not faster and made my code a lot less readable, because often you scan through all the pieces and you have to scan through every list. Then I read Bob Hyatts online paper about 0x88 and created again a piecelist[16] and a board with links to the list places. At the begin of the search I compact order the lsit (means I throw out all the deleted pieces). During the search I just zero (or set a capture flag) a piece in the list and make a link to it from a captured_pieceslist[] for undomove. For the right order of the pieces in the list I don't care right now, because for SEE I sort the atacking and defending pieces afterwards and for search I du the following: I make local list copies pawns[] knights[] bishops[] rooks[] queens[] Then I scan through my picelist[16] and distribute the pieces to the local list. (This is a for-loop to 16 and dosen't cost very much time) Then I do for every knight -> knightmoves etc and at the end for every pawn ->pawnmoves Andy
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.