From 10c0fa442c8a9a4ec36a8c92afde6630d6e392b1 Mon Sep 17 00:00:00 2001
From: Coding with Tom <146443103+hcsalmon1@users.noreply.github.com>
Date: Tue, 14 Jan 2025 11:58:18 +0000
Subject: [PATCH] Update Algorithm explanation.txt

---
 Algorithm explanation.txt | 24 +++++++++++++++++++++++-
 1 file changed, 23 insertions(+), 1 deletion(-)

diff --git a/Algorithm explanation.txt b/Algorithm explanation.txt
index 0f21c99..2a1538b 100644
--- a/Algorithm explanation.txt	
+++ b/Algorithm explanation.txt	
@@ -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] =
     {