X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovegen.h;h=2a4cda90dffef0117e450fdbe1a7491103f30bb8;hp=48e0dec032ca848ec00118c82d9719fd7c1a8968;hb=45b0aea875860e9f0fe2d0435ee6163906639194;hpb=c02613860a3836bb85da25ae2fed9f1351ba27a5 diff --git a/src/movegen.h b/src/movegen.h index 48e0dec0..2a4cda90 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 Marco Costalba + Copyright (C) 2008-2013 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,27 +17,42 @@ along with this program. If not, see . */ - -#if !defined(MOVEGEN_H_INCLUDED) +#ifndef MOVEGEN_H_INCLUDED #define MOVEGEN_H_INCLUDED -//// -//// Includes -//// - -#include "position.h" - - -//// -//// Prototypes -//// - -extern int generate_captures(const Position &pos, MoveStack *mlist); -extern int generate_noncaptures(const Position &pos, MoveStack *mlist); -extern int generate_checks(const Position &pos, MoveStack *mlist, Bitboard dc); -extern int generate_evasions(const Position &pos, MoveStack *mlist, Bitboard pinned); -extern int generate_legal_moves(const Position &pos, MoveStack *mlist); -extern bool move_is_legal(const Position &pos, const Move m, Bitboard pinned); - - -#endif // !defined(MOVEGEN_H_INCLUDED) +#include "types.h" + +enum GenType { + CAPTURES, + QUIETS, + QUIET_CHECKS, + EVASIONS, + NON_EVASIONS, + LEGAL +}; + +class Position; + +template +ExtMove* generate(const Position& pos, ExtMove* 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)) { last->move = MOVE_NONE; } + void operator++() { cur++; } + Move operator*() const { return cur->move; } + size_t size() const { return last - mlist; } + bool contains(Move m) const { + for (const ExtMove* it(mlist); it != last; ++it) if (it->move == m) return true; + return false; + } + +private: + ExtMove mlist[MAX_MOVES]; + ExtMove *cur, *last; +}; + +#endif // #ifndef MOVEGEN_H_INCLUDED