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-30 01:42:04 +00:00
committed by GitHub
parent 24c1bb97fe
commit 44fa0d26ad
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
Algorithm explanation.txt
View File

@@ -547,7 +547,7 @@ This can be a problem if "square" is not valid though. I do it this way:
When you minus 1 bitboard, it removes the smallest bit and sets all bits below it. When you minus 1 bitboard, it removes the smallest bit and sets all bits below it.
We then just AND this with the bitboard to remove the smallest bit. We then just AND this with the bitboard to remove the smallest bit.
1 1 1 1 1 1 1 1 _ _ _ _ _ _ _ _
_ 1 1 1 1 1 1 1 _ 1 1 1 1 1 1 1
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
@@ -555,7 +555,7 @@ We then just AND this with the bitboard to remove the smallest bit.
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
& &
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
_ 1 1 1 1 1 1 1 _ 1 1 1 1 1 1 1
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
@@ -574,6 +574,7 @@ We then just AND this with the bitboard to remove the smallest bit.
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
We removed the first piece.