X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovegen.h;h=c5c6e3e274726c3ecd3509a9b23902b0cfc69ee0;hp=88d64053c4c6dadf6e10c6fedc8e7f8ea3dec2a1;hb=d98150dffc69a810b0b842244aec0d29deddabfb;hpb=94dcac1feeb142a56ed2ebddb96ef672460f1d49 diff --git a/src/movegen.h b/src/movegen.h index 88d64053..c5c6e3e2 100644 --- a/src/movegen.h +++ b/src/movegen.h @@ -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-2009 Marco Costalba + 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 @@ -17,28 +17,39 @@ along with this program. If not, see . */ - #if !defined(MOVEGEN_H_INCLUDED) #define MOVEGEN_H_INCLUDED -//// -//// Includes -//// - -#include "position.h" - - -//// -//// Prototypes -//// - -extern MoveStack* generate_captures(const Position& pos, MoveStack* mlist); -extern MoveStack* generate_noncaptures(const Position& pos, MoveStack* mlist); -extern MoveStack* generate_non_capture_checks(const Position& pos, MoveStack* mlist); -extern MoveStack* generate_evasions(const Position& pos, MoveStack* mlist); -extern MoveStack* generate_moves(const Position& pos, MoveStack* mlist, bool pseudoLegal = false); -extern bool move_is_legal(const Position& pos, const Move m, Bitboard pinned); -extern bool move_is_legal(const Position& pos, const Move m); - +#include "types.h" + +enum MoveType { + MV_CAPTURE, + MV_NON_CAPTURE, + MV_NON_CAPTURE_CHECK, + MV_EVASION, + MV_NON_EVASION, + MV_LEGAL +}; + +class Position; + +template +MoveStack* generate(const Position& pos, MoveStack* mlist); + +/// The MoveList struct is a simple wrapper around generate(), sometimes comes +/// handy to use this class instead of the low level generate() function. +template +struct MoveList { + + explicit MoveList(const Position& pos) : cur(mlist), last(generate(pos, mlist)) {} + void operator++() { cur++; } + bool end() const { return cur == last; } + Move move() const { return cur->move; } + int size() const { return int(last - mlist); } + +private: + MoveStack mlist[MAX_MOVES]; + MoveStack *cur, *last; +}; #endif // !defined(MOVEGEN_H_INCLUDED)