TalkChess.com

Posted: **Wed Nov 16, 2016 2:25 pm**

Hello!
You guys remember SBAMG: Subtraction based Attack Mask Generation? Matthew Brades has pointed out that it invokes undefined behaviour by calling msb(0) sometimes. So here is the fix, in a more concise way than before.

Code: Select all

uint64_t rank_attacks&#40;int sq, uint64_t occ&#41;
&#123;
    occ = &#40;occ & RankMaskEx&#91;sq&#93;) | RankOuterSquares&#91;sq&#93;;
    return (&#40;occ - ThisAndNextSq&#91;msb&#40;occ & PrevSquares&#91;sq&#93;)&#93;) ^ occ&#41; & RankMaskEx&#91;sq&#93;;
&#125;
uint64_t file_attacks&#40;int sq, uint64_t occ&#41;
&#123;
    occ = &#40;occ & FileMaskEx&#91;sq&#93;) | FileOuterSquares&#91;sq&#93;;
    return (&#40;occ - ThisAndNextSq&#91;msb&#40;occ & PrevSquares&#91;sq&#93;)&#93;) ^ occ&#41; & FileMaskEx&#91;sq&#93;;
&#125;

...where

Code: Select all

RankMaskEx&#91;sq&#93; = Bitboard of the rank mask excluding the bitboard of square 'sq' &#40;same for FileMaskEx&#91;sq&#93;);
ThisAndNextSq&#91;sq&#93; = 3ULL << sq;
PrevSquares&#91;0&#93; = 1;
PrevSquares&#91;sq&#93; = &#40;1ULL << sq&#41; - 1 &#40;sq != 0&#41;
RankOuterSquares&#91;sq&#93; = (&#40;0x81ULL << &#40;sq & 56&#41;) & ~&#40;1ULL << sq&#41;) | 1;
FileOuterSquares&#91;sq&#93; = (&#40;0x100000000000001ULL << &#40;sq & 7&#41;) & ~&#40;1ULL << sq&#41;) | 1;

Posted: **Wed Nov 16, 2016 7:41 pm**

This is really interesting. I guess it performs well too. Maybe it should get put into the chess wiki.

Posted: **Wed Nov 16, 2016 8:08 pm**

Dann Corbit wrote:This is really interesting. I guess it performs well too. Maybe it should get put into the chess wiki.

https://chessprogramming.wikispaces.com/SBAMG

Posted: **Thu Nov 17, 2016 5:25 am**

Evert wrote:
Dann Corbit wrote:This is really interesting. I guess it performs well too. Maybe it should get put into the chess wiki.
https://chessprogramming.wikispaces.com/SBAMG

First of all, a big thanks to Gerd Isenberg for explaining it so wonderfully!
Apparently I can't edit the wiki. Could someone please update the code? Here are the corrections you need to make:

Change

Code: Select all

int bsq = bsr64&#40;occ & pMask->lower&#41;;

to

Code: Select all

int bsq = bsr64&#40;&#40;occ & pMask->lower&#41; | 1&#41;;  // Avoid calling bsr64&#40;0&#41;

Thanks!

Posted: **Thu Nov 17, 2016 9:46 am**

hmm ... is the | 1 really necessary?

Lower (PrevSquares[sq]) should always intersect with outer (RankOuterSquares[sq]). Then argument of bsr is always not empty and bsr defined ...

assert ( pMask->outer & pMask->lower);
occ |= pMask->outer;
int bsq = bsr64(occ & pMask->lower);

Gerd

Posted: **Wed Nov 30, 2016 5:10 am**

Gerd Isenberg wrote:hmm ... is the | 1 really necessary?

Lower (PrevSquares[sq]) should always intersect with outer (RankOuterSquares[sq]). Then argument of bsr is always not empty and bsr defined ...

assert ( pMask->outer & pMask->lower);
occ |= pMask->outer;
int bsq = bsr64(occ & pMask->lower);

Gerd

Hi!
I'm sorry for the late reply.
An exception to this is sq = 0, in while case RankOuterSquare[0] & PrevSquares[0] can be 0, because RankOuterSquares[sq] mustn't contain the bit board of square sq.
And oh, thanks for giving SBAMG a wonderful CPW page!

Posted: **Wed Nov 30, 2016 1:19 pm**

vittyvirus wrote:
Gerd Isenberg wrote:hmm ... is the | 1 really necessary?

Lower (PrevSquares[sq]) should always intersect with outer (RankOuterSquares[sq]). Then argument of bsr is always not empty and bsr defined ...

assert ( pMask->outer & pMask->lower);
occ |= pMask->outer;
int bsq = bsr64(occ & pMask->lower);

Gerd
Hi!
I'm sorry for the late reply.
An exception to this is sq = 0, in while case RankOuterSquare[0] & PrevSquares[0] can be 0, because RankOuterSquares[sq] mustn't contain the bit board of square sq.
And oh, thanks for giving SBAMG a wonderful CPW page!

Simply let ...OuterSquares[0] = 1 and PrevSquares[0] = 1 as well and msb is always defined and ThisAndNextSq at least 3. MaskEx ensures rook or bishop on square zero is excluded from attacks anyway.

Some rank 0 samples with rook (r) on square 0
on otherwise empty rank 0

Code: Select all

index 7654 3210
      0000 000r
occ   0000 0001  1
pre   0000 0001  1 -> msb = 0
thine 0000 0011  3
-     1111 1110  1-3 = -2
^     1111 1111 -2 ^ 1 = -1
atta  1111 1110  & RankMaskEx

or with blocker (b) on next square

Code: Select all

      0000 00br
occ   0000 0011  3
pre   0000 0001  -> msb = 0
thine 0000 0011  3
-     0000 0000  3 - 3 = 0
^     0000 0011  0 ^ 3 = 3
atta  0000 0010  & RankMaskEx

or

Code: Select all

      0000 0b0r
occ   0000 0101  5
pre   0000 0001  -> msb = 0
thine 0000 0011  3
-     0000 0010  5 - 3 = 2
^     0000 0111  2 ^ 5 = 7
atta  0000 0110  & RankMaskEx

or

Code: Select all

      bbbb bbbr
occ   1111 1111  -1
pre   0000 0001  -> msb = 0
thine 0000 0011  3
-     1111 1100  -1 - 3 = -4
^     0000 0011  -4 ^ -1 = 3
atta  0000 0010  & RankMaskEx

TalkChess.com

Subtraction based Attack Mask Generation

Subtraction based Attack Mask Generation

Re: Subtraction based Attack Mask Generation

Re: Subtraction based Attack Mask Generation

Re: Subtraction based Attack Mask Generation

Re: Subtraction based Attack Mask Generation

Re: Subtraction based Attack Mask Generation

Re: Subtraction based Attack Mask Generation