X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fmovegen.cpp;h=da8d08c3e4611ca9cce5f645e2616189d234ac2b;hb=68c78400c8eb1b9946caa93d6013eff1d985e577;hp=259d276b3d79f122de26a1ad4c826fd671498bf4;hpb=f036239521fe4f6afb7e8cbc51d860ffa476f6bd;p=stockfish

diff --git a/src/movegen.cpp b/src/movegen.cpp
index 259d276b..da8d08c3 100644
--- a/src/movegen.cpp
+++ b/src/movegen.cpp
@@ -32,35 +32,29 @@
 
 namespace {
 
-  inline Bitboard forward_white(Bitboard b) { return b << 8; }
-  inline Bitboard forward_right_white(Bitboard b) { return b << 9; }
-  inline Bitboard forward_left_white(Bitboard b) { return b << 7; }
-
-  inline Bitboard forward_black(Bitboard b) { return b >> 8; }
-  inline Bitboard forward_right_black(Bitboard b) { return b >> 7; }
-  inline Bitboard forward_left_black(Bitboard b) { return b >> 9; }
-
   struct PawnOffsets {
 
       Bitboard Rank3BB, Rank8BB;
       Rank RANK_8;
       SquareDelta DELTA_N, DELTA_NE, DELTA_NW;
       Color us, them;
-      typedef Bitboard (*Shift_fn)(Bitboard b);
-      Shift_fn forward, forward_left, forward_right;
   };
+  const PawnOffsets WhitePawnOffsets = { Rank3BB, Rank8BB, RANK_8, DELTA_N, DELTA_NE, DELTA_NW, WHITE, BLACK };
+  const PawnOffsets BlackPawnOffsets = { Rank6BB, Rank1BB, RANK_1, DELTA_S, DELTA_SE, DELTA_SW, BLACK, WHITE };
+  
+  int generate_castle_moves(const Position&, MoveStack*, Color);
 
-  const PawnOffsets WhitePawnOffsets = { Rank3BB, Rank8BB, RANK_8, DELTA_N, DELTA_NE, DELTA_NW, WHITE, BLACK,
-                                         &forward_white, forward_left_white, forward_right_white };
+  template<Color>
+  int generate_pawn_captures(const Position&, MoveStack*);
 
-  const PawnOffsets BlackPawnOffsets = { Rank6BB, Rank1BB, RANK_1, DELTA_S, DELTA_SE, DELTA_SW, BLACK, WHITE,
-                                         &forward_black, &forward_left_black, &forward_right_black };
+  template<Color>
+  int generate_pawn_noncaptures(const Position&, MoveStack*);
   
-  int generate_pawn_captures(const PawnOffsets&, const Position&, MoveStack*);  
-  int generate_pawn_noncaptures(const PawnOffsets&, const Position&, MoveStack*);
-  int generate_pawn_checks(const PawnOffsets&, const Position&, Bitboard, Square, MoveStack*, int);
-  int generate_castle_moves(const Position&, MoveStack*, Color);
-  int generate_pawn_blocking_evasions(const PawnOffsets&, const Position&, Bitboard, Bitboard, MoveStack*, int);
+  template<Color>
+  int generate_pawn_checks(const Position&, Bitboard, Square, MoveStack*, int);
+
+  template<Color>
+  int generate_pawn_blocking_evasions(const Position&, Bitboard, Bitboard, MoveStack*, int);
 
   template<PieceType>
   int generate_piece_moves(const Position&, MoveStack*, Color, Bitboard);
@@ -70,6 +64,93 @@ namespace {
 
   template<PieceType>
   int generate_piece_blocking_evasions(const Position&, Bitboard, Bitboard, MoveStack*, int);
+
+
+  /// Templates are defined here to avoid lookup issues with specializations
+
+  template<PieceType Piece>
+  int generate_piece_moves(const Position &pos, MoveStack *mlist, 
+                           Color side, Bitboard target) {
+    int n = 0;
+    for (int i = 0; i < pos.piece_count(side, Piece); i++)
+    {
+        Square from = pos.piece_list(side, Piece, i);
+        Bitboard b = pos.piece_attacks<Piece>(from) & target;
+        while (b)
+        {
+            Square to = pop_1st_bit(&b);
+            mlist[n++].move = make_move(from, to);
+        }
+    }
+    return n;
+  }
+
+
+  template<PieceType Piece>
+  int generate_piece_checks(const Position& pos, Bitboard target, Bitboard dc,
+                            Square ksq, MoveStack* mlist, int n) {
+    // Discovered checks
+    Bitboard b = target & dc;
+    while (b)
+    {
+        Square from = pop_1st_bit(&b);
+        Bitboard bb = pos.piece_attacks<Piece>(from) & pos.empty_squares();
+        while (bb)
+        {
+            Square to = pop_1st_bit(&bb);
+            mlist[n++].move = make_move(from, to);
+        }
+    }
+    // Direct checks
+    b = target & ~dc;
+    Bitboard checkSqs = pos.piece_attacks<Piece>(ksq) & pos.empty_squares();
+    while (b)
+    {
+        Square from = pop_1st_bit(&b);
+        Bitboard bb = pos.piece_attacks<Piece>(from) & checkSqs;
+        while (bb)
+        {
+            Square to = pop_1st_bit(&bb);
+            mlist[n++].move = make_move(from, to);
+        }
+    }
+    return n;
+  }
+
+
+  template<> // Special case the King
+  int generate_piece_checks<KING>(const Position& pos, Bitboard, Bitboard dc,
+                                  Square ksq, MoveStack* mlist, int n) {
+    if (bit_is_set(dc, ksq))
+    {
+        Bitboard bb =   pos.piece_attacks<KING>(ksq)
+                      & pos.empty_squares()
+                      & ~QueenPseudoAttacks[ksq];
+        while (bb)
+        {
+            Square to = pop_1st_bit(&bb);
+            mlist[n++].move = make_move(ksq, to);
+        }
+    }
+    return n;
+  }
+
+  
+  template<PieceType Piece>
+  int generate_piece_blocking_evasions(const Position& pos, Bitboard b,
+                                       Bitboard blockSquares, MoveStack* mlist, int n) {
+    while (b)
+    {
+        Square from = pop_1st_bit(&b);
+        Bitboard bb = pos.piece_attacks<Piece>(from) & blockSquares;
+        while (bb)
+        {
+            Square to = pop_1st_bit(&bb);
+            mlist[n++].move = make_move(from, to);
+        }
+    }
+    return n;
+  }
 }
 
 
@@ -91,9 +172,9 @@ int generate_captures(const Position& pos, MoveStack* mlist) {
   int n;
 
   if (us == WHITE)
-      n = generate_pawn_captures(WhitePawnOffsets, pos, mlist);
+      n = generate_pawn_captures<WHITE>(pos, mlist);
   else
-      n = generate_pawn_captures(BlackPawnOffsets, pos, mlist);
+      n = generate_pawn_captures<BLACK>(pos, mlist);
 
   n += generate_piece_moves<KNIGHT>(pos, mlist+n, us, target);
   n += generate_piece_moves<BISHOP>(pos, mlist+n, us, target);
@@ -117,9 +198,9 @@ int generate_noncaptures(const Position& pos, MoveStack *mlist) {
   int n;
 
   if (us == WHITE)
-      n = generate_pawn_noncaptures(WhitePawnOffsets, pos, mlist);
+      n = generate_pawn_noncaptures<WHITE>(pos, mlist);
   else
-      n = generate_pawn_noncaptures(BlackPawnOffsets, pos, mlist);
+      n = generate_pawn_noncaptures<BLACK>(pos, mlist);
 
   n += generate_piece_moves<KNIGHT>(pos, mlist+n, us, target);
   n += generate_piece_moves<BISHOP>(pos, mlist+n, us, target);
@@ -151,9 +232,9 @@ int generate_checks(const Position& pos, MoveStack* mlist, Bitboard dc) {
 
   // Pawn moves
   if (us == WHITE)    
-     n = generate_pawn_checks(WhitePawnOffsets, pos, dc, ksq, mlist, 0);
+     n = generate_pawn_checks<WHITE>(pos, dc, ksq, mlist, 0);
   else
-     n = generate_pawn_checks(BlackPawnOffsets, pos, dc, ksq, mlist, 0);
+     n = generate_pawn_checks<BLACK>(pos, dc, ksq, mlist, 0);
 
   // Pieces moves
   Bitboard b = pos.knights(us);
@@ -172,17 +253,8 @@ int generate_checks(const Position& pos, MoveStack* mlist, Bitboard dc) {
   if (b)
       n = generate_piece_checks<QUEEN>(pos, b, dc, ksq, mlist, n);
 
-  // King moves
-  Square from = pos.king_square(us);
-  if (bit_is_set(dc, from))
-  {
-      b = pos.piece_attacks<KING>(from) & pos.empty_squares() & ~QueenPseudoAttacks[ksq];
-      while (b)
-      {
-          Square to = pop_1st_bit(&b);
-          mlist[n++].move = make_move(from, to);
-      }
-  }
+  // Hopefully we always have a king ;-)
+  n = generate_piece_checks<KING>(pos, b, dc, pos.king_square(us), mlist, n);
 
   // TODO: Castling moves!
   
@@ -284,9 +356,9 @@ int generate_evasions(const Position& pos, MoveStack* mlist) {
           // Pawn moves. Because a blocking evasion can never be a capture, we
           // only generate pawn pushes.
           if (us == WHITE)
-              n = generate_pawn_blocking_evasions(WhitePawnOffsets, pos, not_pinned, blockSquares, mlist, n);
+              n = generate_pawn_blocking_evasions<WHITE>(pos, not_pinned, blockSquares, mlist, n);
           else
-              n = generate_pawn_blocking_evasions(BlackPawnOffsets, pos, not_pinned, blockSquares, mlist, n);
+              n = generate_pawn_blocking_evasions<BLACK>(pos, not_pinned, blockSquares, mlist, n);
 
           // Pieces moves
           b1 = pos.knights(us) & not_pinned;
@@ -551,7 +623,10 @@ Move generate_move_if_legal(const Position &pos, Move m, Bitboard pinned) {
 
 namespace {
 
-  int generate_pawn_captures(const PawnOffsets& ofs, const Position& pos, MoveStack* mlist) {
+  template<Color C>
+  int generate_pawn_captures(const Position& pos, MoveStack* mlist) {
+
+    static const PawnOffsets ofs = (C == WHITE ? WhitePawnOffsets : BlackPawnOffsets);
 
     Bitboard pawns = pos.pawns(ofs.us);
     Bitboard enemyPieces = pos.pieces_of_color(ofs.them);
@@ -559,7 +634,7 @@ namespace {
     int n = 0;
 
     // Captures in the a1-h8 (a8-h1 for black) direction
-    Bitboard b1 = (ofs.forward_right)(pawns) & ~FileABB & enemyPieces;
+    Bitboard b1 = (C == WHITE ? pawns << 9 : pawns >> 7) & ~FileABB & enemyPieces;
 
     // Capturing promotions
     Bitboard b2 = b1 & ofs.Rank8BB;
@@ -578,7 +653,7 @@ namespace {
     }
 
     // Captures in the h1-a8 (h8-a1 for black) direction
-    b1 = (ofs.forward_left)(pawns) & ~FileHBB & enemyPieces;
+    b1 = (C == WHITE ? pawns << 7 : pawns >> 9) & ~FileHBB & enemyPieces;
 
     // Capturing promotions
     b2 = b1 & ofs.Rank8BB;
@@ -597,7 +672,7 @@ namespace {
     }
 
     // Non-capturing promotions
-    b1 = (ofs.forward)(pawns) & pos.empty_squares() & Rank8BB;
+    b1 = (C == WHITE ? pawns << 8 : pawns >> 8) & pos.empty_squares() & Rank8BB;
     while (b1)
     {
         sq = pop_1st_bit(&b1);
@@ -623,7 +698,10 @@ namespace {
   }
 
 
-  int generate_pawn_noncaptures(const PawnOffsets& ofs, const Position& pos, MoveStack* mlist) {
+  template<Color C>
+  int generate_pawn_noncaptures(const Position& pos, MoveStack* mlist) {
+
+    static const PawnOffsets ofs = (C == WHITE ? WhitePawnOffsets : BlackPawnOffsets);
 
     Bitboard pawns = pos.pawns(ofs.us);
     Bitboard enemyPieces = pos.pieces_of_color(ofs.them);
@@ -633,7 +711,7 @@ namespace {
     int n = 0;
 
     // Underpromotion captures in the a1-h8 (a8-h1 for black) direction
-    b1 = ofs.forward_right(pawns) & ~FileABB & enemyPieces & ofs.Rank8BB;
+    b1 = (C == WHITE ? pawns << 9 : pawns >> 7) & ~FileABB & enemyPieces & ofs.Rank8BB;
     while (b1)
     {
         sq = pop_1st_bit(&b1);
@@ -643,7 +721,7 @@ namespace {
     }
 
     // Underpromotion captures in the h1-a8 (h8-a1 for black) direction
-    b1 = ofs.forward_left(pawns) & ~FileHBB & enemyPieces & ofs.Rank8BB;
+    b1 = (C == WHITE ? pawns << 7 : pawns >> 9) & ~FileHBB & enemyPieces & ofs.Rank8BB;
     while (b1)
     {
         sq = pop_1st_bit(&b1);
@@ -653,7 +731,7 @@ namespace {
     }
 
     // Single pawn pushes
-    b1 = ofs.forward(pawns) & emptySquares;
+    b1 = (C == WHITE ? pawns << 8 : pawns >> 8) & emptySquares;
     b2 = b1 & ofs.Rank8BB;
     while (b2)
     {
@@ -670,7 +748,7 @@ namespace {
     }
 
     // Double pawn pushes
-    b2 = (ofs.forward(b1 & ofs.Rank3BB)) & emptySquares;
+    b2 = (C == WHITE ? (b1 & ofs.Rank3BB) << 8 : (b1 & ofs.Rank3BB) >> 8) & emptySquares;
     while (b2)
     {
       sq = pop_1st_bit(&b2);
@@ -680,128 +758,11 @@ namespace {
   }
 
 
-  template<PieceType Piece>
-  int generate_piece_moves(const Position &pos, MoveStack *mlist, 
-                           Color side, Bitboard target) {
-
-    Square from, to;
-    Bitboard b;
-    int n = 0;
-
-    for (int i = 0; i < pos.piece_count(side, Piece); i++)
-    {
-        from = pos.piece_list(side, Piece, i);
-        b = pos.piece_attacks<Piece>(from) & target;
-        while (b)
-        {
-            to = pop_1st_bit(&b);
-            mlist[n++].move = make_move(from, to);
-        }
-    }
-    return n;
-  }
-
-
-  int generate_castle_moves(const Position &pos, MoveStack *mlist, Color us) {
-
-    int n = 0;
-
-    if (pos.can_castle(us))
-    {
-        Color them = opposite_color(us);
-        Square ksq = pos.king_square(us);        
-
-        assert(pos.piece_on(ksq) == king_of_color(us));
-
-        if (pos.can_castle_kingside(us))
-        {
-            Square rsq = pos.initial_kr_square(us);
-            Square g1 = relative_square(us, SQ_G1);
-            Square f1 = relative_square(us, SQ_F1);
-            Square s;
-            bool illegal = false;
-
-            assert(pos.piece_on(rsq) == rook_of_color(us));
-
-            for (s = Min(ksq, g1); s <= Max(ksq, g1); s++)
-                if (  (s != ksq && s != rsq && pos.square_is_occupied(s))
-                    || pos.square_is_attacked(s, them))
-                    illegal = true;
-
-            for (s = Min(rsq, f1); s <= Max(rsq, f1); s++)
-                if (s != ksq && s != rsq && pos.square_is_occupied(s))
-                    illegal = true;
-
-            if (!illegal)
-                mlist[n++].move = make_castle_move(ksq, rsq);
-      }
-
-      if (pos.can_castle_queenside(us))
-      {
-          Square rsq = pos.initial_qr_square(us);
-          Square c1 = relative_square(us, SQ_C1);
-          Square d1 = relative_square(us, SQ_D1);
-          Square s;
-          bool illegal = false;        
-
-          assert(pos.piece_on(rsq) == rook_of_color(us));
-
-          for (s = Min(ksq, c1); s <= Max(ksq, c1); s++)
-              if (  (s != ksq && s != rsq && pos.square_is_occupied(s))
-                  || pos.square_is_attacked(s, them))
-                  illegal = true;
-
-          for (s = Min(rsq, d1); s <= Max(rsq, d1); s++)
-              if (s != ksq && s != rsq && pos.square_is_occupied(s))
-                  illegal = true;
-
-        if (   square_file(rsq) == FILE_B
-            && (   pos.piece_on(relative_square(us, SQ_A1)) == rook_of_color(them)
-                || pos.piece_on(relative_square(us, SQ_A1)) == queen_of_color(them)))
-            illegal = true;
-                         
-        if (!illegal)
-            mlist[n++].move = make_castle_move(ksq, rsq);
-      }
-    }
-    return n;
-  }
-
-  template<PieceType Piece>
-  int generate_piece_checks(const Position& pos, Bitboard target, Bitboard dc,
-                            Square ksq, MoveStack* mlist, int n) {
-
-    // Discovered checks
-    Bitboard b = target & dc;
-    while (b)
-    {
-        Square from = pop_1st_bit(&b);
-        Bitboard bb = pos.piece_attacks<Piece>(from) & pos.empty_squares();
-        while (bb)
-        {
-            Square to = pop_1st_bit(&bb);
-            mlist[n++].move = make_move(from, to);
-        }
-    }
-
-    // Direct checks
-    b = target & ~dc;
-    Bitboard checkSqs = pos.piece_attacks<Piece>(ksq) & pos.empty_squares();
-    while (b)
-    {
-        Square from = pop_1st_bit(&b);
-        Bitboard bb = pos.piece_attacks<Piece>(from) & checkSqs;
-        while (bb)
-        {
-            Square to = pop_1st_bit(&bb);
-            mlist[n++].move = make_move(from, to);
-        }
-    }
-    return n;
-  }
-
-  int generate_pawn_checks(const PawnOffsets& ofs, const Position& pos, Bitboard dc, Square ksq, MoveStack* mlist, int n)
+  template<Color C>
+  int generate_pawn_checks(const Position& pos, Bitboard dc, Square ksq, MoveStack* mlist, int n)
   {
+    static const PawnOffsets ofs = (C == WHITE ? WhitePawnOffsets : BlackPawnOffsets);
+
     // Pawn moves which give discovered check. This is possible only if the 
     // pawn is not on the same file as the enemy king, because we don't 
     // generate captures.
@@ -811,7 +772,7 @@ namespace {
     Bitboard b1 = pos.pawns(pos.side_to_move()) & ~file_bb(ksq), b2, b3;
 
     // Discovered checks, single pawn pushes
-    b2 = b3 = (ofs.forward)(b1 & dc) & ~ofs.Rank8BB & empty;
+    b2 = b3 = (C == WHITE ? (b1 & dc) << 8 : (b1 & dc) >> 8) & ~ofs.Rank8BB & empty;
     while (b3)
     {
         Square to = pop_1st_bit(&b3);
@@ -819,7 +780,7 @@ namespace {
     }
 
     // Discovered checks, double pawn pushes
-    b3 = (ofs.forward)(b2 & ofs.Rank3BB) & empty;
+    b3 = (C == WHITE ? (b2 & ofs.Rank3BB) << 8 : (b2 & ofs.Rank3BB) >> 8) & empty;
     while (b3)
     {
         Square to = pop_1st_bit(&b3);
@@ -832,7 +793,7 @@ namespace {
     b1 &= (~dc & neighboring_files_bb(ksq)); // FIXME why ~dc ??
 
     // Direct checks, single pawn pushes
-    b2 = (ofs.forward)(b1) & empty;
+    b2 = (C == WHITE ? b1 << 8 : b1 >> 8) & empty;
     b3 = b2 & pos.pawn_attacks(ofs.them, ksq);
     while (b3)
     {
@@ -841,7 +802,10 @@ namespace {
     }
 
     // Direct checks, double pawn pushes
-    b3 = (ofs.forward)(b2 & ofs.Rank3BB) & empty & pos.pawn_attacks(ofs.them, ksq);
+    b3 =  (C == WHITE ? (b2 & ofs.Rank3BB) << 8 : (b2 & ofs.Rank3BB) >> 8)
+        & empty
+        & pos.pawn_attacks(ofs.them, ksq);
+
     while (b3)
     {
         Square to = pop_1st_bit(&b3);
@@ -850,32 +814,18 @@ namespace {
     return n;
   }
 
+  template<Color C>
+  int generate_pawn_blocking_evasions(const Position& pos, Bitboard not_pinned,
+                                      Bitboard blockSquares, MoveStack* mlist, int n) {
 
-   template<PieceType Piece>
-   int generate_piece_blocking_evasions(const Position& pos, Bitboard b,
-                                        Bitboard blockSquares, MoveStack* mlist, int n) {
-    while (b)
-    {
-        Square from = pop_1st_bit(&b);
-        Bitboard bb = pos.piece_attacks<Piece>(from) & blockSquares;
-        while (bb)
-        {
-            Square to = pop_1st_bit(&bb);
-            mlist[n++].move = make_move(from, to);
-        }
-    }
-    return n;
-  }
-
+    static const PawnOffsets ofs = (C == WHITE ? WhitePawnOffsets : BlackPawnOffsets);
 
-  int generate_pawn_blocking_evasions(const PawnOffsets& ofs, const Position& pos, Bitboard not_pinned,
-                                      Bitboard blockSquares, MoveStack* mlist, int n) {
     // Find non-pinned pawns
     Bitboard b1 = pos.pawns(ofs.us) & not_pinned;
 
     // Single pawn pushes. We don't have to AND with empty squares here,
     // because the blocking squares will always be empty.
-    Bitboard b2 = (ofs.forward)(b1) & blockSquares;
+    Bitboard b2 = (C == WHITE ? b1 << 8 : b1 >> 8) & blockSquares;
     while (b2)
     {
         Square to = pop_1st_bit(&b2);
@@ -893,7 +843,8 @@ namespace {
     }
 
     // Double pawn pushes
-    b2 = (ofs.forward)((ofs.forward)(b1) & pos.empty_squares() & ofs.Rank3BB) & blockSquares;
+    b2 = (C == WHITE ? b1 << 8 : b1 >> 8) & pos.empty_squares() & ofs.Rank3BB;
+    b2 = (C == WHITE ? b2 << 8 : b2 >> 8) & blockSquares;;
     while (b2)
     {
         Square to = pop_1st_bit(&b2);
@@ -906,4 +857,70 @@ namespace {
     }
     return n;
   }
+
+
+  int generate_castle_moves(const Position &pos, MoveStack *mlist, Color us) {
+
+    int n = 0;
+
+    if (pos.can_castle(us))
+    {
+        Color them = opposite_color(us);
+        Square ksq = pos.king_square(us);        
+
+        assert(pos.piece_on(ksq) == king_of_color(us));
+
+        if (pos.can_castle_kingside(us))
+        {
+            Square rsq = pos.initial_kr_square(us);
+            Square g1 = relative_square(us, SQ_G1);
+            Square f1 = relative_square(us, SQ_F1);
+            Square s;
+            bool illegal = false;
+
+            assert(pos.piece_on(rsq) == rook_of_color(us));
+
+            for (s = Min(ksq, g1); s <= Max(ksq, g1); s++)
+                if (  (s != ksq && s != rsq && pos.square_is_occupied(s))
+                    || pos.square_is_attacked(s, them))
+                    illegal = true;
+
+            for (s = Min(rsq, f1); s <= Max(rsq, f1); s++)
+                if (s != ksq && s != rsq && pos.square_is_occupied(s))
+                    illegal = true;
+
+            if (!illegal)
+                mlist[n++].move = make_castle_move(ksq, rsq);
+      }
+
+      if (pos.can_castle_queenside(us))
+      {
+          Square rsq = pos.initial_qr_square(us);
+          Square c1 = relative_square(us, SQ_C1);
+          Square d1 = relative_square(us, SQ_D1);
+          Square s;
+          bool illegal = false;        
+
+          assert(pos.piece_on(rsq) == rook_of_color(us));
+
+          for (s = Min(ksq, c1); s <= Max(ksq, c1); s++)
+              if (  (s != ksq && s != rsq && pos.square_is_occupied(s))
+                  || pos.square_is_attacked(s, them))
+                  illegal = true;
+
+          for (s = Min(rsq, d1); s <= Max(rsq, d1); s++)
+              if (s != ksq && s != rsq && pos.square_is_occupied(s))
+                  illegal = true;
+
+        if (   square_file(rsq) == FILE_B
+            && (   pos.piece_on(relative_square(us, SQ_A1)) == rook_of_color(them)
+                || pos.piece_on(relative_square(us, SQ_A1)) == queen_of_color(them)))
+            illegal = true;
+                         
+        if (!illegal)
+            mlist[n++].move = make_castle_move(ksq, rsq);
+      }
+    }
+    return n;
+  }
 }