// Rule 1. Checks which give opponent's king at most one escape square are dangerous
b = kingAtt & ~pos.pieces(them) & ~newAtt & ~(1ULL << to);
- if (single_bit(b)) // Catches also !b
+ if (!more_than_one(b))
return true;
// Rule 2. Queen contact check is very dangerous
// Case 3: Moving through the vacated square
p2 = pos.piece_on(f2);
- if (piece_is_slider(p2) && (squares_between(f2, t2) & f1))
+ if (piece_is_slider(p2) && (between_bb(f2, t2) & f1))
return true;
// Case 4: The destination square for m2 is defended by the moving piece in m1
// Case 5: Discovered check, checking piece is the piece moved in m1
ksq = pos.king_square(pos.side_to_move());
if ( piece_is_slider(p1)
- && (squares_between(t1, ksq) & f2)
+ && (between_bb(t1, ksq) & f2)
&& (pos.attacks_from(p1, t1, pos.pieces() ^ f2) & ksq))
return true;
// Case 3: If the moving piece in the threatened move is a slider, don't
// prune safe moves which block its ray.
if ( piece_is_slider(pos.piece_on(tfrom))
- && (squares_between(tfrom, tto) & mto)
+ && (between_bb(tfrom, tto) & mto)
&& pos.see_sign(m) >= 0)
return true;
// our feet by the sp master. Also accessing other Thread objects is
// unsafe because if we are exiting there is a chance are already freed.
lock_release(sp->lock);
-
- // Try to reparent to another split point. Only for slave threads
- // that are not master of any active split point.
- if ( !sp_master
- && !is_searching
- && !do_sleep
- && !do_exit
- && !splitPointsCnt
- && Threads.size() > 2)
- {
- for (int i = 0; i < Threads.size(); i++)
- {
- SplitPoint* oldest = &Threads[i].splitPoints[0];
-
- // Find the first oldest split point with still all slaves running
- if ( Threads[i].splitPointsCnt
- && oldest->slavesMask == oldest->allSlavesMask
- && !single_bit(oldest->allSlavesMask))
- {
- lock_grab(oldest->lock);
- lock_grab(Threads.splitLock); // Needed by is_searching
-
- // Retest all under lock protection, we are in the middle
- // of a race storm !
- if ( !is_searching
- && !do_sleep
- && !do_exit
- && Threads[i].splitPointsCnt
- && oldest->slavesMask == oldest->allSlavesMask
- && !single_bit(oldest->allSlavesMask))
- {
- oldest->slavesMask |= 1ULL << idx; // allSlavesMask is not updated
- curSplitPoint = oldest;
- is_searching = true;
- }
-
- lock_release(Threads.splitLock);
- lock_release(oldest->lock);
-
- break; // Exit anyhow, only one try (enough in 99% of cases)
- }
- }
- }
}
}
}