OMGeeky/hcsalmon1-Chess-Engine-Test
1
0
Fork 0
mirror of https://github.com/OMGeeky/hcsalmon1-Chess-Engine-Test.git synced 2026-02-23 15:49:51 +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 19:14:24 +00:00
committed by GitHub
parent 2364223f45
commit 4c58a7cf60
1 changed files with 3 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
Algorithm explanation.txt
View File

@@ -29,6 +29,9 @@ These are the same. To make this a bit more human I also made square constants:
const int A8 = 0, B8 = 1, C8 = 2 etc. const int A8 = 0, B8 = 1, C8 = 2 etc.
Normally integers use Big Endian Format, meaning the highest numbers at the start.
I will print bitboards the opposite to be more like a chess board. So in this order:
1,2,4,8,16,32,64,128 etc.
To remove a bit we need to set that bit on a ulong and then invert the bits: To remove a bit we need to set that bit on a ulong and then invert the bits:
unsigned long long bitboard = 0; unsigned long long bitboard = 0;