OMGeeky/hcsalmon1-Chess-Engine-Test
1
0
Fork 0
mirror of https://github.com/OMGeeky/hcsalmon1-Chess-Engine-Test.git synced 2025-12-26 16:27:23 +01:00
Code Issues Packages Projects Releases Wiki Activity

Update Algorithm explanation.txt

Browse Source
This commit is contained in:
Coding with Tom
2025-01-14 11:58:18 +00:00
committed by GitHub
parent 8f83d2e610
commit 10c0fa442c
1 changed files with 23 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
Algorithm explanation.txt
View File

@@ -201,7 +201,29 @@ will be stored.
}
}
For pins it's a bit more complicated
For pins it's a bit more complicated. We first need INBETWEEN_BITBOARDS.
This is a multi dimensional array that simple has all of this bits inbetween every square combination.
Example:
INBETWEEN_BITBOARD[E1][E8] =
0 0 0 0 0 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0
INBETWEEN_BITBOARD[E1][E8] =
0 0 0 0 0 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0
int pinArray[8][2] =
{