Author: Bruce Moreland
Date: 11:19:37 11/07/98
Go up one level in this thread
On November 07, 1998 at 13:30:59, Steve Maughan wrote: >On November 07, 1998 at 12:40:01, Bruce Moreland wrote: > >>Best way to determine if it's faster is to try it. > >Sure. I'll have to write the program first :( > >I'm just at the start of writing the program and wondered if anyone has had >carried out any experiements in this area. Intuatively, the passing the pointer >to the data structure seems better, but I've never heard of anyone using this >approach. Me. I just stuff all the stuff into a structure and go. The structure is a statically allocated array A lot of the elements are precomputed, meaning that if white is to move at ply 0, white will also be to move at ply 2, etc., so I save a little bit of computation. My original idea was to write the whole thing in assembly code, without any local variables in the search function. This would let me free up a register (BP), which I could then just load with the address of this structure, so I could efficiently access any member in the thing, and my assembly would be faster than the C version because I'd have that extra register to play with. I implemented it this way, too, and it worked. bruce
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.