Stack ss[MAX_PLY_PLUS_2];
int depth, prevBestMoveChanges;
Value bestValue, alpha, beta, delta;
+ bool triedEasyMove = false;
memset(ss, 0, 4 * sizeof(Stack));
depth = BestMoveChanges = 0;
// Stop search early if one move seems to be much better than others
if ( depth >= 12
&& !stop
+ && !triedEasyMove
&& PVSize == 1
&& ( RootMoves.size() == 1
|| Time::now() - SearchTime > (TimeMgr.available_time() * 20) / 100))
{
+ triedEasyMove = true;
Value rBeta = bestValue - 2 * PawnValueMg;
(ss+1)->excludedMove = RootMoves[0].pv[0];
(ss+1)->skipNullMove = true;