printf("%d %d %d %d", iterDepth, xbScore, ReadClock(0)/10, nodeCount);
for(tail=pvStart; *tail; tail++) printf(" %s", MoveToText(*tail));
printf("\n"); fflush(stdout);
+ ff->move = moveStack[bestNr];
}
}
}
alpha = startAlpha; // reset alpha for next iteration
// put best in front
- ff->move = moveStack[bestNr];
if(bestNr > m.firstMove) {
int bestMove = moveStack[bestNr];
if(bestNr == m.firstMove+1) moveStack[bestNr] = moveStack[m.firstMove]; else m.firstMove--; // swap first two, or prepend duplicat