Author: Andrew Williams
Date: 10:35:45 06/25/01
Go up one level in this thread
On June 25, 2001 at 12:56:26, Artem Pyatakov wrote: >I have decided to keep track of attack tables in my program, because I think >they will save computation time in the eval. > >My question now is this, given the experience of most people in this group, what >is the most useful info to keep in the attack table? > >Should I just keep the number of times that white is attacking the square and >black is attacking the square? Or is it very useful to keep track of what actual >pieces (and on what position on board) are attacking the square on both sides? > >Or is it some other kind of attack info? > >Thanks for all of your responses. My program has one 32-bit unsigned integer per square. Each bit in this integer corresponds to one of the pieces; if the piece is attacking the square, the bit is 1, otherwise it is 0. I keep these integers up-to-date during my makemove(), so I can use my attack tables for generating captures and my static exchange evaluator, as well as in my evaluation. When I started with these attack tables, I generated them from scratch each time (I was only using them for evaluation then). When I switched to keeping them up to date, I used this function extensively for testing. Andrew
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.