feat: add initial attacksToSquare

1 files changed, 35 insertions, 23 deletions

diff --git a/src/main.c b/src/main.c
index f21e17c..904d8b7 100644
--- a/src/main.c
+++ b/src/main.c
@@ -21,16 +21,16 @@ int main() {
     unitTest(board.enPassantSquare == 0, "No en passant move is avaialble");
   }
 
-  testSection("Test knight attacks"); {
+  testSection("Knight attack table"); {
     Bitboard attacks[64];
     precomputeKnightAttackTable(attacks);
 
-    int max_attacks = 0;
+    int maxAttacks = 0;
     for (int i = 0; i < 64; i++) {
-      int attack_count = popCount(attacks[i]);
-      if (attack_count > max_attacks) max_attacks = attack_count;
+      int attackCount = popCount(attacks[i]);
+      if (attackCount > maxAttacks) maxAttacks = attackCount;
     }
-    unitTest(max_attacks == 8, "Max amount of knight attacks should be 8");
+    unitTest(maxAttacks == 8, "Max amount of knight attacks should be 8");
 
     unitTest(
         attacks[b7] == ((BIT << d8) | (BIT << d6) | (BIT << c5) | (BIT << a5)),
@@ -38,16 +38,16 @@ int main() {
     );
   }
 
-  testSection("Test king attacks"); {
+  testSection("King attack table"); {
     Bitboard attacks[64];
     precomputeKingAttackTable(attacks);
 
-    int max_attacks = 0;
+    int maxAttacks = 0;
     for (int i = 0; i < 64; i++) {
-      int attack_count = popCount(attacks[i]);
-      if (attack_count > max_attacks) max_attacks = attack_count;
+      int attackCount = popCount(attacks[i]);
+      if (attackCount > maxAttacks) maxAttacks = attackCount;
     }
-    unitTest(max_attacks == 8, "Max amount of king attacks should be 8");
+    unitTest(maxAttacks == 8, "Max amount of king attacks should be 8");
 
     unitTest(
         attacks[h2] == ((BIT << h1) | (BIT << g1) | (BIT << g2) | (BIT << g3) | (BIT << h3)),
@@ -55,23 +55,35 @@ int main() {
     );
   }
 
-  testSection("Test pawn attacks"); {
-    Bitboard white_attacks[64];
-    Bitboard black_attacks[64];
+  testSection("Pawn attack table"); {
+    Bitboard whiteAttacks[64];
+    Bitboard blackAttacks[64];
 
-    precomputePawnAttackTable(white_attacks, WHITE);
-    precomputePawnAttackTable(black_attacks, BLACK);
+    precomputePawnAttackTable(whiteAttacks, WHITE);
+    precomputePawnAttackTable(blackAttacks, BLACK);
 
-    int is_same = 0;
-    int max_attacks = 0;
+    int isSame = 0;
+    int maxAttacks = 0;
     for (int i = 0; i < 64; i++) {
-      int attack_count = popCount(white_attacks[i]);
-      if (attack_count > max_attacks) max_attacks = attack_count;
-      if (white_attacks[i] == black_attacks[i]) is_same = 1;
+      int attackCount = popCount(whiteAttacks[i]);
+      if (attackCount > maxAttacks) maxAttacks = attackCount;
+      if (whiteAttacks[i] == blackAttacks[i]) isSame = 1;
     }
-    unitTest(max_attacks == 2, "Max amount of pawn attacks should be 2");
-    unitTest(is_same == 0, "Black and white pawns always move differently");
-    unitTest(white_attacks[g2] == (BIT << h3 | BIT << f3), "White pawn on g2 attacks only h3 and f3");
+    unitTest(maxAttacks == 2, "Max amount of pawn attacks should be 2");
+    unitTest(isSame == 0, "Black and white pawns always move differently");
+    unitTest(whiteAttacks[g2] == (BIT << h3 | BIT << f3), "White pawn on g2 attacks only h3 and f3");
+  }
+
+  testSection("Attacks to square in starting position"); {
+    precomputeKnightAttackTable(KNIGHT_ATTACKS);
+    precomputePawnAttackTable(WHITE_PAWN_ATTACKS, WHITE);
+    precomputePawnAttackTable(BLACK_PAWN_ATTACKS, BLACK);
+    Board board = parseFEN("rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1");
+
+    unitTest(attacksToSquare(board, c3) == ((BIT << b1) | (BIT << b2) | (BIT << d2)), "c3 is protected only by b1, b2, d2");
+    unitTest(attacksToSquare(board, f6) == ((BIT << g8) | (BIT << g7) | (BIT << e7)), "f6 is protected only by g8, g7, e7");
+    // TODO
+    unitTest(attacksToSquare(board, d2) == ((BIT << b1) | (BIT << c1) | (BIT << d1) | (BIT << e1)), "d2 is protected only b1, c1, d1, e1");
   }
 
   report();