mirror of
https://github.com/HChaZZY/Stockfish.git
synced 2025-12-24 11:06:58 +08:00
d3608c4e79
Add MOVE_NONE at the tail, this allows to loop across MoveList checking for *it != MOVE_NONE, and because *it is used imediately after compiler is able to reuse it. With this small patch perft speed increased of 3% And it is also a semplification ! No functional change.
59 lines
1.7 KiB
C++
59 lines
1.7 KiB
C++
/*
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
|
|
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
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
Stockfish is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#if !defined(MOVEGEN_H_INCLUDED)
|
|
#define MOVEGEN_H_INCLUDED
|
|
|
|
#include "types.h"
|
|
|
|
enum GenType {
|
|
CAPTURES,
|
|
QUIETS,
|
|
QUIET_CHECKS,
|
|
EVASIONS,
|
|
NON_EVASIONS,
|
|
LEGAL
|
|
};
|
|
|
|
class Position;
|
|
|
|
template<GenType>
|
|
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<GenType T>
|
|
struct MoveList {
|
|
|
|
explicit MoveList(const Position& pos) : cur(mlist), last(generate<T>(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 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)
|