Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: questions about dynamically updating attackboards

Author: Ross Boyd

Date: 21:35:07 08/23/03

Go up one level in this thread


On August 23, 2003 at 17:00:29, Uri Blass wrote:

>I have the following piece list
>
>int queens[9][2];
>int rooks[10][2];
>int bishops[10][2];
>int knights[10][2];
>int pawns[8][2];

Hi Uri,

This has nothing to do with attackboards...

A common optimisation is to declare your arrays like this...

int queens[2][9];
int rooks[2][10];
int bishops[2][10];
int knights[2][10];
int pawns[2][8];

This may result in an overall speedup if you usually iterate through all the
pieces for one side only. The reason this is faster is to do with the ordering
of the arrays in memory and memory paging....

Try it and see.. it may help,

Ross







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.