- // Step 1. Hunt for unstoppable pawns. If we find at least one, record how many plies
- // are required for promotion
- int pliesToGo[2] = {256, 256};
+ Score evaluate_unstoppable_pawns(const Position& pos, EvalInfo& ei) {
+
+ Bitboard b, b2, blockers, supporters, queeningPath, candidates;
+ Square s, blockSq, queeningSquare;
+ Color c, winnerSide, loserSide;
+ bool pathDefended, opposed;
+ int pliesToGo, movesToGo, oppMovesToGo, sacptg, blockersCount, minKingDist, kingptg, d;
+ int pliesToQueen[] = { 256, 256 };