X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=sidebyside;f=src%2Fmovegen.h;h=c96e73cfd07d2d53d9c70a1d4658490ed708b7fa;hb=818e0b2d2b0e2b2eaa8279c8f6684770dc4550e9;hp=991b0de30294e4eac09f07c696f2e0eedc3849e7;hpb=ae4967744686ae6e95ca0cdb9e0d788de05d4e03;p=stockfish
diff --git a/src/movegen.h b/src/movegen.h
index 991b0de3..c96e73cf 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-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,28 +17,43 @@
along with this program. If not, see .
*/
-
#if !defined(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_non_capture_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);
-extern bool move_is_legal(const Position& pos, const Move m);
-
+#include "types.h"
+
+enum GenType {
+ CAPTURES,
+ QUIETS,
+ QUIET_CHECKS,
+ EVASIONS,
+ NON_EVASIONS,
+ 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; }
+ size_t size() const { return last - mlist; }
+ bool contains(Move m) const {
+ for (const MoveStack* it(mlist); it != last; ++it) if (it->move == m) return true;
+ return false;
+ }
+
+private:
+ MoveStack mlist[MAX_MOVES];
+ MoveStack *cur, *last;
+};
#endif // !defined(MOVEGEN_H_INCLUDED)