Author: Jean Efpraxiadis
Date: 20:41:58 06/01/03
Go up one level in this thread
On June 01, 2003 at 16:37:17, Russell Reagan wrote: >On June 01, 2003 at 15:19:35, Jean Efpraxiadis wrote: > >>Is there a version of TSCP that uses Hash tables and does not locate the pieces >>on the board by scanning the board square by square during move generation? > >Is there any particular method of piece location that you had in mind? For >instance, do you care if it's an array of squares into the board, or bitboards, >or something else? If the location of each piece of the board was stored in a array and updated in make and unmake move, so that the move generator could use these locations instead of taking the board square by square, that would be fine. I am not looking for a bitboard implementation of TSCP. I doubt someone took the trouble to modify TSCP that way. Anyway, a version of TSCP with hash tables would do still do it for me. The rest I am willing to do myself if I have to.
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.