1
0
Fork 0

Fix perft 1

Compute correct number of moves for this corner case.

A smal bug crept in after recent perft rework.

No functional change.
pull/39/merge
Marco Costalba 2014-08-09 11:33:02 +02:00 committed by lucasart
parent a903ed07e0
commit 8b8885ab07
1 changed files with 1 additions and 1 deletions

View File

@ -163,7 +163,7 @@ uint64_t Search::perft(Position& pos, Depth depth) {
for (MoveList<LEGAL> it(pos); *it; ++it)
{
if (Root && depth <= ONE_PLY)
cnt = 1;
cnt = 1, nodes++;
else
{
pos.do_move(*it, st, ci, pos.gives_check(*it, ci));