X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovegen.cpp;h=1082ad016aab60bbe60c7a782113b38920e7efb5;hp=dd849c15604813c9ba6acf005d807fa4e508f682;hb=67338e6f322b8f8ec0d897815e16a87937efc9b0;hpb=5c8af7ccb8f59f901740d5a8f4a9270f69487583 diff --git a/src/movegen.cpp b/src/movegen.cpp index dd849c15..1082ad01 100644 --- a/src/movegen.cpp +++ b/src/movegen.cpp @@ -1,7 +1,7 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -47,8 +47,7 @@ namespace { template inline MoveStack* generate_discovered_checks(const Position& pos, MoveStack* mlist, Square from) { - assert(Pt != QUEEN); - assert(Pt != PAWN); + assert(Pt != QUEEN && Pt != PAWN); Bitboard b = pos.attacks_from(from) & pos.empty_squares(); @@ -62,8 +61,7 @@ namespace { template inline MoveStack* generate_direct_checks(const Position& pos, MoveStack* mlist, Color us, Bitboard dc, Square ksq) { - assert(Pt != KING); - assert(Pt != PAWN); + assert(Pt != KING && Pt != PAWN); Bitboard checkSqs, b; Square from; @@ -198,7 +196,7 @@ template MoveStack* generate(const Position& pos, MoveStack* mli template MoveStack* generate(const Position& pos, MoveStack* mlist); -/// generate_non_capture_checks() generates all pseudo-legal non-captures and knight +/// generate generates all pseudo-legal non-captures and knight /// underpromotions that give check. Returns a pointer to the end of the move list. template<> MoveStack* generate(const Position& pos, MoveStack* mlist) { @@ -238,8 +236,8 @@ MoveStack* generate(const Position& pos, MoveStack* mlist) } -/// generate_evasions() generates all pseudo-legal check evasions when -/// the side to move is in check. Returns a pointer to the end of the move list. +/// generate generates all pseudo-legal check evasions when the side +/// to move is in check. Returns a pointer to the end of the move list. template<> MoveStack* generate(const Position& pos, MoveStack* mlist) { @@ -251,7 +249,7 @@ MoveStack* generate(const Position& pos, MoveStack* mlist) { Color us = pos.side_to_move(); Square ksq = pos.king_square(us); Bitboard checkers = pos.checkers(); - Bitboard sliderAttacks = EmptyBoardBB; + Bitboard sliderAttacks = 0; assert(pos.piece_on(ksq) == make_piece(us, KING)); assert(checkers); @@ -374,20 +372,20 @@ namespace { to = pop_1st_bit(&b); if (Type == MV_CAPTURE || Type == MV_EVASION) - (*mlist++).move = make_promotion_move(to - Delta, to, QUEEN); + (*mlist++).move = make_promotion(to - Delta, to, QUEEN); if (Type == MV_NON_CAPTURE || Type == MV_EVASION) { - (*mlist++).move = make_promotion_move(to - Delta, to, ROOK); - (*mlist++).move = make_promotion_move(to - Delta, to, BISHOP); - (*mlist++).move = make_promotion_move(to - Delta, to, KNIGHT); + (*mlist++).move = make_promotion(to - Delta, to, ROOK); + (*mlist++).move = make_promotion(to - Delta, to, BISHOP); + (*mlist++).move = make_promotion(to - Delta, to, KNIGHT); } // This is the only possible under promotion that can give a check // not already included in the queen-promotion. if ( Type == MV_CHECK && bit_is_set(pos.attacks_from(to), pos.king_square(Delta > 0 ? BLACK : WHITE))) - (*mlist++).move = make_promotion_move(to - Delta, to, KNIGHT); + (*mlist++).move = make_promotion(to - Delta, to, KNIGHT); else (void)pos; // Silence a warning under MSVC } return mlist; @@ -485,12 +483,12 @@ namespace { b1 = pawns & pos.attacks_from(pos.ep_square(), Them); - assert(b1 != EmptyBoardBB); + assert(b1); while (b1) { to = pop_1st_bit(&b1); - (*mlist++).move = make_enpassant_move(to, pos.ep_square()); + (*mlist++).move = make_enpassant(to, pos.ep_square()); } } return mlist; @@ -537,7 +535,7 @@ namespace { return mlist; } - (*mlist++).move = make_castle_move(kfrom, rfrom); + (*mlist++).move = make_castle(kfrom, rfrom); return mlist; }