Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Counting attacked squares: how?

Author: Vincent Diepeveen

Date: 18:07:42 01/25/02

Go up one level in this thread


On January 25, 2002 at 16:16:41, Severi Salminen wrote:

>>since when I wrote mobility from the first time i use
>>(with the only difference that they are in spanish of course :))
>>
>>mobilityBishop[]
>>mobilityRookNS[]
>>mobilityRookWE[]
>>
>>so instead of a ++ or something while looping I do, for example for bishops:
>>mobility+=mobilityBishop[i];
>>
>>of course mobilityBishop[i] is bigger when i is closer the center.
>
>Is i a target square or what? So you are giving more mobility bonus if the
>target is nearer the center? Is it worht it - I mean you have to loop through
>all the squares and perform a table lookup. I just count the number of all the
>squares (both occupied and empty ones) I can move to and weight it. It's quite
>fast with bitboards.

Please show some C code that is doing what Tony is doing in Xinix.

Horror....

>Severi



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.