summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
a903ed0)
Compute correct number of moves for this corner case.
A smal bug crept in after recent perft rework.
No functional change.
for (MoveList<LEGAL> it(pos); *it; ++it)
{
if (Root && depth <= ONE_PLY)
for (MoveList<LEGAL> it(pos); *it; ++it)
{
if (Root && depth <= ONE_PLY)
else
{
pos.do_move(*it, st, ci, pos.gives_check(*it, ci));
else
{
pos.do_move(*it, st, ci, pos.gives_check(*it, ci));