Author: Robert Hyatt
Date: 10:30:32 07/09/02
Go up one level in this thread
On July 09, 2002 at 12:39:04, Martin Bauer wrote: >On July 09, 2002 at 11:54:17, Robert Hyatt wrote: > >>We did this in Cray Blitz. We had an additional 64 square "chess board" but >>rather than the piece id for a square, it was a pointer into the piece list >>so that we could remove (we just zeroed it actually) the entry. > >Sounds good, thanks > >>We then >>iterated over this list generating moves, which worked great on a vector >>machine. > >If you just zeroed the entry of an removed piece, you must always loop over the >complete List with 32 entries? > >Like: > >for i := 1 to 32 do No. You only do the first half or the last half depending on which side is on move. We further had a first and last pointer for both white and black. So that as a piece is actually removed from the board at the root, the lists get smaller. Within the search, we looped over the entire original half of the list, but with vectors that was free.
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.