Author: Uri Blass
Date: 13:56:07 08/30/03
Go up one level in this thread
On August 30, 2003 at 14:37:44, Tord Romstad wrote: >My program has reached the stage where it is so complicated and ugly that I >no longer understand clearly how it works (it's rather miraculous that it >works at all), and there are many parts of the code which I am afraid of >touching because I am sure I will break something. Besides, the program >is horribly slow, searching only about 120 kN/s on a PIV 2.4 GHz. > >Because of this, I think it is time to throw away all the old code and >start from scratch. Before I do this, I will consider replacing my >data structures with something more efficient. > >Today, my board representation consists of a 256-byte array of squares >(visualised as a 16x16 board with the real board in the left half of >the middle 8 ranks) and a Phalanx-style piece list. At every node in >the tree, I generate "attack tables" similar to those found in Rebel, >Phalanx and Diep (the tables are not updated incrementally). How do you know the attack tables of diep? Uri
This page took 0.01 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.