/*
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-2009 Marco Costalba
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/>.
*/
struct SplitPoint {
SplitPoint *parent;
Position pos;
- SearchStack sstack[THREAD_MAX][PLY_MAX];
+ SearchStack sstack[THREAD_MAX][PLY_MAX_PLUS_2];
SearchStack *parentSstack;
int ply;
Depth depth;
- volatile Value alpha, beta, bestValue;
+ volatile Value alpha, beta, bestValue, futilityValue;
+ Value approximateEval;
bool pvNode;
- Bitboard dcCandidates;
int master, slaves[THREAD_MAX];
Lock lock;
MovePicker *mp;
SplitPoint *splitPoint;
int activeSplitPoints;
uint64_t nodes;
+ uint64_t betaCutOffs[2];
bool failHighPly1;
volatile bool stop;
volatile bool running;
volatile bool idle;
volatile bool workIsWaiting;
volatile bool printCurrentLine;
- unsigned char pad[64];
+ unsigned char pad[64]; // set some distance among local data for each thread
};