mirror of
https://github.com/opelly27/Stockfish.git
synced 2026-05-20 13:17:44 +00:00
Marco Costalba
fca0a2dd88
Here the idea is to test probcut not only after bad captures, but after any bad move, i.e. any move that leaves the opponent with a good capture. Ported by a patch from Onno, the difference from original version is that we have moved probcut after null search. After 7917 games 4 threads 20"+0.1 Mod vs Orig: 1261 - 1095 - 5561 ELO +7 (+- 4.2) LOS 96% Signed-off-by: Marco Costalba <mcostalba@gmail.com>
65 lines
2.2 KiB
C++
65 lines
2.2 KiB
C++
/*
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
|
|
Copyright (C) 2008-2010 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 MOVEPICK_H_INCLUDED
|
|
#define MOVEPICK_H_INCLUDED
|
|
|
|
#include "history.h"
|
|
#include "move.h"
|
|
#include "position.h"
|
|
#include "types.h"
|
|
|
|
struct SearchStack;
|
|
|
|
/// MovePicker is a class which is used to pick one pseudo legal move at a time
|
|
/// from the current position. It is initialized with a Position object and a few
|
|
/// moves we have reason to believe are good. The most important method is
|
|
/// MovePicker::get_next_move(), which returns a new pseudo legal move each time
|
|
/// it is called, until there are no moves left, when MOVE_NONE is returned.
|
|
/// In order to improve the efficiency of the alpha beta algorithm, MovePicker
|
|
/// attempts to return the moves which are most likely to get a cut-off first.
|
|
|
|
class MovePicker {
|
|
|
|
MovePicker& operator=(const MovePicker&); // Silence a warning under MSVC
|
|
|
|
public:
|
|
MovePicker(const Position&, Move, Depth, const History&, SearchStack*, Value);
|
|
MovePicker(const Position&, Move, Depth, const History&);
|
|
MovePicker(const Position&, Move, const History&, int parentCapture);
|
|
Move get_next_move();
|
|
|
|
private:
|
|
void score_captures();
|
|
void score_noncaptures();
|
|
void score_evasions();
|
|
void go_next_phase();
|
|
|
|
const Position& pos;
|
|
const History& H;
|
|
Move ttMove;
|
|
MoveStack killers[2];
|
|
int captureThreshold, phase;
|
|
const uint8_t* phasePtr;
|
|
MoveStack *curMove, *lastMove, *lastGoodNonCapture, *badCaptures;
|
|
MoveStack moves[MAX_MOVES];
|
|
};
|
|
|
|
#endif // !defined(MOVEPICK_H_INCLUDED)
|