Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Attack detection with bitboards: alternative to "rotated bitboards"

Author: Inmann Werner

Date: 06:12:29 12/06/99

Go up one level in this thread


On December 06, 1999 at 08:53:12, Robert Hyatt wrote:

>On December 05, 1999 at 22:47:06, KarinsDad wrote:
>
>>On December 05, 1999 at 11:00:19, Robert Hyatt wrote:
>>
>>[snip]
>>>
>>>
>>> you need 256 entries because that is the number of possible states of any >>> rankor diagonal.
>>

Hmm...

Definitions:
AFRhorizontal[64][256]
SlideIndexH[8]

at llokup:
val=AFRhorizontal[s][SlideIndex[...]]

so this are 8 possibilities!?!?!
Why we need 256???

Werner




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.