mirror of
https://github.com/peterosterlund2/droidfish.git
synced 2025-12-13 01:22:41 +01:00
DroidFish: Implemented DTZ/WDL tablebase hints in the GUI when only syzygy tablebases are available.
This commit is contained in:
Peter Osterlund
216
DroidFish/jni/rtb/moveGen.hpp
Normal file
216
DroidFish/jni/rtb/moveGen.hpp
Normal file
@@ -0,0 +1,216 @@
|
||||
/*
|
||||
Texel - A UCI chess engine.
|
||||
Copyright (C) 2012-2014 Peter Österlund, peterosterlund2@gmail.com
|
||||
|
||||
This program 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.
|
||||
|
||||
This program 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/>.
|
||||
*/
|
||||
|
||||
/*
|
||||
* moveGen.hpp
|
||||
*
|
||||
* Created on: Feb 25, 2012
|
||||
* Author: petero
|
||||
*/
|
||||
|
||||
#ifndef MOVEGEN_HPP_
|
||||
#define MOVEGEN_HPP_
|
||||
|
||||
#include "move.hpp"
|
||||
#include "position.hpp"
|
||||
#include "util.hpp"
|
||||
|
||||
#include <cassert>
|
||||
|
||||
//#define MOVELIST_DEBUG
|
||||
|
||||
#ifdef MOVELIST_DEBUG
|
||||
# include <set>
|
||||
# include "textio.hpp"
|
||||
#endif
|
||||
|
||||
/**
|
||||
* Generates move lists (pseudo-legal, legal, check evasions, captures).
|
||||
*/
|
||||
class MoveGen {
|
||||
private:
|
||||
static const int MAX_MOVES = 256;
|
||||
|
||||
public:
|
||||
|
||||
/** A stack-allocated move list object. */
|
||||
class MoveList {
|
||||
private:
|
||||
int buf[sizeof(Move[MAX_MOVES])/sizeof(int)];
|
||||
public:
|
||||
int size;
|
||||
|
||||
MoveList() : size(0) { }
|
||||
void clear() { size = 0; }
|
||||
|
||||
Move& operator[](int i) { return ((Move*)&buf[0])[i]; }
|
||||
const Move& operator[](int i) const { return ((Move*)&buf[0])[i]; }
|
||||
|
||||
void addMove(int from, int to, int promoteTo) {
|
||||
Move& m = (*this)[size++];
|
||||
new (&m) Move(from, to, promoteTo);
|
||||
}
|
||||
};
|
||||
|
||||
/**
|
||||
* Generate and return a list of pseudo-legal moves.
|
||||
* Pseudo-legal means that the moves don't necessarily defend from check threats.
|
||||
*/
|
||||
template <bool wtm>
|
||||
static void pseudoLegalMoves(const Position& pos, MoveList& moveList);
|
||||
static void pseudoLegalMoves(const Position& pos, MoveList& moveList);
|
||||
|
||||
/**
|
||||
* Generate and return a list of pseudo-legal check evasion moves.
|
||||
* Pseudo-legal means that the moves don't necessarily defend from check threats.
|
||||
*/
|
||||
template <bool wtm>
|
||||
static void checkEvasions(const Position& pos, MoveList& moveList);
|
||||
static void checkEvasions(const Position& pos, MoveList& moveList);
|
||||
|
||||
/** Generate and return a list of pseudo-legal capture moves. */
|
||||
template <bool wtm>
|
||||
static void pseudoLegalCaptures(const Position& pos, MoveList& moveList);
|
||||
static void pseudoLegalCaptures(const Position& pos, MoveList& moveList);
|
||||
|
||||
/**
|
||||
* Return true if the side to move is in check.
|
||||
*/
|
||||
static bool inCheck(const Position& pos) {
|
||||
int kingSq = pos.getKingSq(pos.isWhiteMove());
|
||||
return sqAttacked(pos, kingSq);
|
||||
}
|
||||
|
||||
/**
|
||||
* Return true if the side to move can take the opponents king.
|
||||
*/
|
||||
static bool canTakeKing(Position& pos) {
|
||||
pos.setWhiteMove(!pos.isWhiteMove());
|
||||
bool ret = inCheck(pos);
|
||||
pos.setWhiteMove(!pos.isWhiteMove());
|
||||
return ret;
|
||||
}
|
||||
|
||||
/**
|
||||
* Return true if a square is attacked by the opposite side.
|
||||
*/
|
||||
static bool sqAttacked(const Position& pos, int sq) {
|
||||
const U64 occupied = pos.occupiedBB();
|
||||
return sqAttacked(pos, sq, occupied);
|
||||
}
|
||||
static bool sqAttacked(const Position& pos, int sq, U64 occupied) {
|
||||
return pos.isWhiteMove() ? sqAttacked<true>(pos, sq, occupied)
|
||||
: sqAttacked<false>(pos, sq, occupied);
|
||||
}
|
||||
template <bool wtm>
|
||||
static bool sqAttacked(const Position& pos, int sq, U64 occupied) {
|
||||
typedef ColorTraits<!wtm> OtherColor;
|
||||
if ((BitBoard::knightAttacks[sq] & pos.pieceTypeBB(OtherColor::KNIGHT)) != 0)
|
||||
return true;
|
||||
if ((BitBoard::kingAttacks[sq] & pos.pieceTypeBB(OtherColor::KING)) != 0)
|
||||
return true;
|
||||
if (wtm) {
|
||||
if ((BitBoard::wPawnAttacks[sq] & pos.pieceTypeBB(OtherColor::PAWN)) != 0)
|
||||
return true;
|
||||
} else {
|
||||
if ((BitBoard::bPawnAttacks[sq] & pos.pieceTypeBB(OtherColor::PAWN)) != 0)
|
||||
return true;
|
||||
}
|
||||
U64 bbQueen = pos.pieceTypeBB(OtherColor::QUEEN);
|
||||
if ((BitBoard::bishopAttacks(sq, occupied) & (pos.pieceTypeBB(OtherColor::BISHOP) | bbQueen)) != 0)
|
||||
return true;
|
||||
if ((BitBoard::rookAttacks(sq, occupied) & (pos.pieceTypeBB(OtherColor::ROOK) | bbQueen)) != 0)
|
||||
return true;
|
||||
return false;
|
||||
}
|
||||
|
||||
/** Return true if the pseudo-legal move "move" is legal is position "pos".
|
||||
* isInCheck must be equal to inCheck(pos). */
|
||||
static bool isLegal(Position& pos, const Move& move, bool isInCheck);
|
||||
|
||||
private:
|
||||
template <bool wtm>
|
||||
static void addPawnMovesByMask(MoveList& moveList, U64 mask, int delta, bool allPromotions) {
|
||||
typedef ColorTraits<wtm> MyColor;
|
||||
if (mask == 0)
|
||||
return;
|
||||
U64 promMask = mask & BitBoard::maskRow1Row8;
|
||||
mask &= ~promMask;
|
||||
while (promMask != 0) {
|
||||
int sq = BitBoard::numberOfTrailingZeros(promMask);
|
||||
int sq0 = sq + delta;
|
||||
moveList.addMove(sq0, sq, MyColor::QUEEN);
|
||||
moveList.addMove(sq0, sq, MyColor::KNIGHT);
|
||||
if (allPromotions) {
|
||||
moveList.addMove(sq0, sq, MyColor::ROOK);
|
||||
moveList.addMove(sq0, sq, MyColor::BISHOP);
|
||||
}
|
||||
promMask &= (promMask - 1);
|
||||
}
|
||||
while (mask != 0) {
|
||||
int sq = BitBoard::numberOfTrailingZeros(mask);
|
||||
moveList.addMove(sq + delta, sq, Piece::EMPTY);
|
||||
mask &= (mask - 1);
|
||||
}
|
||||
}
|
||||
|
||||
static void addPawnDoubleMovesByMask(MoveList& moveList, U64 mask, int delta) {
|
||||
while (mask != 0) {
|
||||
int sq = BitBoard::numberOfTrailingZeros(mask);
|
||||
moveList.addMove(sq + delta, sq, Piece::EMPTY);
|
||||
mask &= (mask - 1);
|
||||
}
|
||||
}
|
||||
|
||||
static void addMovesByMask(MoveList& moveList, int sq0, U64 mask) {
|
||||
while (mask != 0) {
|
||||
int sq = BitBoard::numberOfTrailingZeros(mask);
|
||||
moveList.addMove(sq0, sq, Piece::EMPTY);
|
||||
mask &= (mask - 1);
|
||||
}
|
||||
}
|
||||
|
||||
MoveGen() = delete;
|
||||
};
|
||||
|
||||
|
||||
inline void
|
||||
MoveGen::pseudoLegalMoves(const Position& pos, MoveList& moveList) {
|
||||
if (pos.isWhiteMove())
|
||||
pseudoLegalMoves<true>(pos, moveList);
|
||||
else
|
||||
pseudoLegalMoves<false>(pos, moveList);
|
||||
}
|
||||
|
||||
inline void
|
||||
MoveGen::checkEvasions(const Position& pos, MoveList& moveList) {
|
||||
if (pos.isWhiteMove())
|
||||
checkEvasions<true>(pos, moveList);
|
||||
else
|
||||
checkEvasions<false>(pos, moveList);
|
||||
}
|
||||
|
||||
inline void
|
||||
MoveGen::pseudoLegalCaptures(const Position& pos, MoveList& moveList) {
|
||||
if (pos.isWhiteMove())
|
||||
pseudoLegalCaptures<true>(pos, moveList);
|
||||
else
|
||||
pseudoLegalCaptures<false>(pos, moveList);
|
||||
}
|
||||
|
||||
#endif /* MOVEGEN_HPP_ */
|
||||
Reference in New Issue
Block a user