//----------------------------------------------------------------------------------------------- public val KXK(cPosicion pos) { if (pos.ColorMueve() == m_cDebil && 0 == (new cReglas(pos, cMovType.LEGAL)).Size()) return cValoresJuego.TABLAS; sq posReyGanador = pos.GetRey(m_cFuerte); sq posReyPerdedor = pos.GetRey(m_cDebil); val result = pos.MaterialPieza(m_cFuerte) + pos.GetNum(m_cFuerte, cPieza.PEON) * cValoresJuego.PEON_FINAL + m_lstValorBorde[posReyPerdedor] + m_lstValorCerrado[cBitBoard.Distancia(posReyGanador, posReyPerdedor)]; if (pos.GetNum(m_cFuerte, cPieza.DAMA) != 0 || pos.GetNum(m_cFuerte, cPieza.TORRE) != 0 || (pos.GetNum(m_cFuerte, cPieza.ALFIL) != 0 && pos.GetNum(m_cFuerte, cPieza.CABALLO) != 0) || pos.IsAlfilPar(m_cFuerte)) { result += cValoresJuego.GANA; } return m_cFuerte == pos.ColorMueve() ? result : -result; }
public static val search(cPosicion pos, cStackMov[] ss, int ssPos, val alpha, val beta, ply depth, bool cutNode, NodeType NT, bool SpNode) { bool RootNode = (NT == cTipoNodo.RAIZ); bool PvNode = (NT == cTipoNodo.PV || NT == cTipoNodo.RAIZ); mov[] quietsSearched = new mov[64]; cPosInfo st = new cPosInfo(); cTablaHashStruct tte; cSplitPoint splitPoint = null; hash posKey = 0; mov ttMove, move, excludedMove, bestMove; ply ext, newDepth, predictedDepth; val bestValue, value, ttValue, eval, nullValue, futilityValue; bool inCheck, givesCheck, pvMove, singularExtensionNode, improving; bool captureOrPromotion, dangerous, doFullDepthSearch; int moveCount = 0, quietCount = 0; cThread thisThread = pos.ThreadActive(); inCheck = pos.Jaques() != 0; if (SpNode) { splitPoint = ss[ssPos].splitPoint; bestMove = splitPoint.bestMove; bestValue = splitPoint.bestValue; tte = null; ttMove = excludedMove = cMovType.MOV_NAN; ttValue = cValoresJuego.NAN; goto moves_loop; } moveCount = quietCount = 0; bestValue = -cValoresJuego.INFINITO; ss[ssPos].currentMove = ss[ssPos].ttMove = ss[ssPos + 1].excludedMove = bestMove = cMovType.MOV_NAN; ss[ssPos].ply = ss[ssPos - 1].ply + 1; ss[ssPos + 1].skipNullMove = 0; ss[ssPos + 1].reduction = cPly.DEPTH_ZERO; ss[ssPos + 2].killers0 = ss[ssPos + 2].killers1 = cMovType.MOV_NAN; if (PvNode && thisThread.m_nMaxPly < ss[ssPos].ply) thisThread.m_nMaxPly = ss[ssPos].ply; if (!RootNode) { if (Signals.STOP || pos.IsTablas() || ss[ssPos].ply > cSearch.MAX_PLY) return ss[ssPos].ply > cSearch.MAX_PLY && !inCheck ? cEval.Eval(pos) : DrawValue[pos.ColorMueve()]; alpha = Math.Max(cTypes.MateEnVs(ss[ssPos].ply), alpha); beta = Math.Min(cTypes.MateEn(ss[ssPos].ply + 1), beta); if (alpha >= beta) return alpha; } excludedMove = ss[ssPos].excludedMove; posKey = excludedMove != 0 ? pos.GetClaveHashExclusion() : pos.ClaveHash(); tte = cMotor.m_TablaHash.Buscar(posKey); ss[ssPos].ttMove = ttMove = RootNode ? RootMoves[PVIdx].m_PV[0] : tte != null ? tte.GetMove() : cMovType.MOV_NAN; ttValue = (tte != null) ? value_from_tt(tte.GetValue(), ss[ssPos].ply) : cValoresJuego.NAN; if (!RootNode && tte != null && tte.GetDepth() >= depth && ttValue != cValoresJuego.NAN && (PvNode ? tte.GetBound() == cBordes.BOUND_EXACT : ttValue >= beta ? (tte.GetBound() & cBordes.BOUND_LOWER) != 0 : (tte.GetBound() & cBordes.BOUND_UPPER) != 0)) { ss[ssPos].currentMove = ttMove; if (ttValue >= beta && ttMove != 0 && !pos.IsCapturaOrPromocion(ttMove) && !inCheck) update_stats(pos, ss, ssPos, ttMove, depth, null, 0); return ttValue; } if (inCheck) { ss[ssPos].staticEval = eval = cValoresJuego.NAN; goto moves_loop; } else if (tte != null) { if ((ss[ssPos].staticEval = eval = tte.GetValueEval()) == cValoresJuego.NAN) eval = ss[ssPos].staticEval = cEval.Eval(pos); if (ttValue != cValoresJuego.NAN) if ((tte.GetBound() & (ttValue > eval ? cBordes.BOUND_LOWER : cBordes.BOUND_UPPER)) != 0) eval = ttValue; } else { eval = ss[ssPos].staticEval = cEval.Eval(pos); cMotor.m_TablaHash.Save(posKey, cValoresJuego.NAN, cBordes.BOUND_NONE, cPly.DEPTH_NONE, cMovType.MOV_NAN, ss[ssPos].staticEval); } if (0 == pos.GetTipoPiezaCapturada() && ss[ssPos].staticEval != cValoresJuego.NAN && ss[ssPos - 1].staticEval != cValoresJuego.NAN && (move = ss[ssPos - 1].currentMove) != cMovType.MOV_NULO && cTypes.TipoMovimiento(move) == cMovType.NORMAL) { sq to = cTypes.GetToCasilla(move); Gains.Fill(pos.GetPieza(to), to, -ss[ssPos - 1].staticEval - ss[ssPos].staticEval); } if (!PvNode && depth < 4 * cPly.ONE_PLY && eval + razor_margin(depth) <= beta && ttMove == cMovType.MOV_NAN && Math.Abs(beta) < cValoresJuego.MATE_MAXIMO && !pos.IsPeonOn7(pos.ColorMueve()) ) { if (depth <= cPly.ONE_PLY && eval + razor_margin(3 * cPly.ONE_PLY) <= alpha) return qsearch(pos, ss, ssPos, alpha, beta, cPly.DEPTH_ZERO, cTipoNodo.NO_PV, false); val ralpha = alpha - razor_margin(depth); val v = qsearch(pos, ss, ssPos, ralpha, ralpha + 1, cPly.DEPTH_ZERO, cTipoNodo.NO_PV, false); if (v <= ralpha) return v; } if (!PvNode && 0 == ss[ssPos].skipNullMove && depth < 7 * cPly.ONE_PLY && eval - futility_margin(depth) >= beta && Math.Abs(beta) < cValoresJuego.MATE_MAXIMO && Math.Abs(eval) < cValoresJuego.GANA && pos.MaterialPieza(pos.ColorMueve()) != 0) return eval - futility_margin(depth); if (!PvNode && 0 == ss[ssPos].skipNullMove && depth >= 2 * cPly.ONE_PLY && eval >= beta && Math.Abs(beta) < cValoresJuego.MATE_MAXIMO && pos.MaterialPieza(pos.ColorMueve()) != 0) { ss[ssPos].currentMove = cMovType.MOV_NULO; ply R = 3 * cPly.ONE_PLY + depth / 4 + (eval - beta) / cValoresJuego.PEON_MJ * cPly.ONE_PLY; pos.DoNullMov(st); ss[ssPos + 1].skipNullMove = 1; nullValue = depth - R < cPly.ONE_PLY ? -qsearch(pos, ss, ssPos + 1, -beta, -beta + 1, cPly.DEPTH_ZERO, cTipoNodo.NO_PV, false) : -search(pos, ss, ssPos + 1, -beta, -beta + 1, depth - R, !cutNode, cTipoNodo.NO_PV, false); ss[ssPos + 1].skipNullMove = 0; pos.undo_null_move(); if (nullValue >= beta) { if (nullValue >= cValoresJuego.MATE_MAXIMO) nullValue = beta; if (depth < 12 * cPly.ONE_PLY) return nullValue; ss[ssPos].skipNullMove = 1; val v = depth - R < cPly.ONE_PLY ? qsearch(pos, ss, ssPos, beta - 1, beta, cPly.DEPTH_ZERO, cTipoNodo.NO_PV, false) : search(pos, ss, ssPos, beta - 1, beta, depth - R, false, cTipoNodo.NO_PV, false); ss[ssPos].skipNullMove = 0; if (v >= beta) return nullValue; } } if (!PvNode && depth >= 5 * cPly.ONE_PLY && 0 == ss[ssPos].skipNullMove && Math.Abs(beta) < cValoresJuego.MATE_MAXIMO) { val rbeta = Math.Min(beta + 200, cValoresJuego.INFINITO); ply rdepth = depth - 4 * cPly.ONE_PLY; cMovOrder mp2 = new cMovOrder(pos, ttMove, History, pos.GetTipoPiezaCapturada()); cInfoJaque ci2 = new cInfoJaque(pos); while ((move = mp2.SiguienteMovimientoEnFalso()) != cMovType.MOV_NAN) if (pos.IsLegalMov(move, ci2.m_Clavadas)) { ss[ssPos].currentMove = move; pos.DoMov(move, st, ci2, pos.IsJaque(move, ci2)); value = -search(pos, ss, ssPos + 1, -rbeta, -rbeta + 1, rdepth, !cutNode, cTipoNodo.NO_PV, false); pos.DesMov(move); if (value >= rbeta) return value; } } if (depth >= (PvNode ? 5 * cPly.ONE_PLY : 8 * cPly.ONE_PLY) && 0 == ttMove && (PvNode || (ss[ssPos].staticEval + 256 >= beta))) { ply d = depth - 2 * cPly.ONE_PLY - (PvNode ? cPly.DEPTH_ZERO : depth / 4); ss[ssPos].skipNullMove = 1; search(pos, ss, ssPos, alpha, beta, d, true, PvNode ? cTipoNodo.PV : cTipoNodo.NO_PV, false); ss[ssPos].skipNullMove = 0; tte = cMotor.m_TablaHash.Buscar(posKey); ttMove = (tte != null) ? tte.GetMove() : cMovType.MOV_NAN; } moves_loop: sq prevMoveSq = cTypes.GetToCasilla(ss[ssPos - 1].currentMove); mov[] countermoves = { Countermoves[pos.GetPieza(prevMoveSq)][prevMoveSq].m_Key1, Countermoves[pos.GetPieza(prevMoveSq)][prevMoveSq].m_Key2 }; sq prevOwnMoveSq = cTypes.GetToCasilla(ss[ssPos - 2].currentMove); mov[] followupmoves = {Followupmoves[pos.GetPieza(prevOwnMoveSq)][prevOwnMoveSq].m_Key1, Followupmoves[pos.GetPieza(prevOwnMoveSq)][prevOwnMoveSq].m_Key2 }; cMovOrder mp = new cMovOrder(pos, ttMove, depth, History, countermoves, followupmoves, ss[ssPos]); cInfoJaque ci = new cInfoJaque(pos); value = bestValue; improving = ss[ssPos].staticEval >= ss[ssPos - 2].staticEval || ss[ssPos].staticEval == cValoresJuego.NAN || ss[ssPos - 2].staticEval == cValoresJuego.NAN; singularExtensionNode = !RootNode && !SpNode && depth >= 8 * cPly.ONE_PLY && ttMove != cMovType.MOV_NAN && 0 == excludedMove && (tte.GetBound() & cBordes.BOUND_LOWER) != 0 && tte.GetDepth() >= depth - 3 * cPly.ONE_PLY; while ((move = (SpNode ? mp.SiguienteMovimiento() : mp.SiguienteMovimientoEnFalso())) != cMovType.MOV_NAN) { if (move == excludedMove) continue; if (RootNode && (Buscar(RootMoves, PVIdx, RootMoves.Count, move) == -1)) continue; if (SpNode) { if (!pos.IsLegalMov(move, ci.m_Clavadas)) continue; moveCount = ++splitPoint.moveCount; splitPoint.mutex.Liberar(); } else ++moveCount; if (RootNode) { Signals.FIRST_MOVE = (moveCount == 1); } ext = cPly.DEPTH_ZERO; captureOrPromotion = pos.IsCapturaOrPromocion(move); givesCheck = cTypes.TipoMovimiento(move) == cMovType.NORMAL && 0 == ci.m_Candidatas ? (ci.m_Jaque[cTypes.TipoPieza(pos.GetPieza(cTypes.GetFromCasilla(move)))] & cBitBoard.m_nCasillas[cTypes.GetToCasilla(move)]) != 0 : pos.IsJaque(move, ci); dangerous = givesCheck || cTypes.TipoMovimiento(move) != cMovType.NORMAL || pos.IsPeonAvanzado(move); if (givesCheck && pos.SEEReducido(move) >= cValoresJuego.CERO) ext = cPly.ONE_PLY; if (singularExtensionNode && move == ttMove && 0 == ext && pos.IsLegalMov(move, ci.m_Clavadas) && Math.Abs(ttValue) < cValoresJuego.GANA) { val rBeta = ttValue - depth; ss[ssPos].excludedMove = move; ss[ssPos].skipNullMove = 1; value = search(pos, ss, ssPos, rBeta - 1, rBeta, depth / 2, cutNode, cTipoNodo.NO_PV, false); ss[ssPos].skipNullMove = 0; ss[ssPos].excludedMove = cMovType.MOV_NAN; if (value < rBeta) ext = cPly.ONE_PLY; } newDepth = depth - cPly.ONE_PLY + ext; if (!PvNode && !captureOrPromotion && !inCheck && !dangerous && bestValue > cValoresJuego.MATE_MAXIMO_VS) { if (depth < 16 * cPly.ONE_PLY && moveCount >= FutilityMoveCounts[improving ? 1 : 0][depth]) { if (SpNode) splitPoint.mutex.Bloquear(); continue; } predictedDepth = newDepth - reduction(improving ? 1 : 0, depth, moveCount, PvNode ? 1 : 0); if (predictedDepth < 7 * cPly.ONE_PLY) { futilityValue = ss[ssPos].staticEval + futility_margin(predictedDepth) + 128 + Gains[pos.GetPiezaMovida(move)][cTypes.GetToCasilla(move)]; if (futilityValue <= alpha) { bestValue = Math.Max(bestValue, futilityValue); if (SpNode) { splitPoint.mutex.Bloquear(); if (bestValue > splitPoint.bestValue) splitPoint.bestValue = bestValue; } continue; } } if (predictedDepth < 4 * cPly.ONE_PLY && pos.SEEReducido(move) < cValoresJuego.CERO) { if (SpNode) splitPoint.mutex.Bloquear(); continue; } } if (!RootNode && !SpNode && !pos.IsLegalMov(move, ci.m_Clavadas)) { moveCount--; continue; } pvMove = PvNode && moveCount == 1; ss[ssPos].currentMove = move; if (!SpNode && !captureOrPromotion && quietCount < 64) quietsSearched[quietCount++] = move; pos.DoMov(move, st, ci, givesCheck); if (depth >= 3 * cPly.ONE_PLY && !pvMove && !captureOrPromotion && move != ttMove && move != ss[ssPos].killers0 && move != ss[ssPos].killers1) { ss[ssPos].reduction = reduction(improving ? 1 : 0, depth, moveCount, PvNode ? 1 : 0); if (!PvNode && cutNode) ss[ssPos].reduction += cPly.ONE_PLY; else if (History[pos.GetPieza(cTypes.GetToCasilla(move))][cTypes.GetToCasilla(move)] < 0) ss[ssPos].reduction += cPly.ONE_PLY / 2; if (move == countermoves[0] || move == countermoves[1]) ss[ssPos].reduction = Math.Max(cPly.DEPTH_ZERO, ss[ssPos].reduction - cPly.ONE_PLY); ply d = Math.Max(newDepth - ss[ssPos].reduction, cPly.ONE_PLY); if (SpNode) alpha = splitPoint.alpha; value = -search(pos, ss, ssPos + 1, -(alpha + 1), -alpha, d, true, cTipoNodo.NO_PV, false); if (value > alpha && ss[ssPos].reduction >= 4 * cPly.ONE_PLY) { ply d2 = Math.Max(newDepth - 2 * cPly.ONE_PLY, cPly.ONE_PLY); value = -search(pos, ss, ssPos + 1, -(alpha + 1), -alpha, d2, true, cTipoNodo.NO_PV, false); } doFullDepthSearch = (value > alpha && ss[ssPos].reduction != cPly.DEPTH_ZERO); ss[ssPos].reduction = cPly.DEPTH_ZERO; } else doFullDepthSearch = !pvMove; if (doFullDepthSearch) { if (SpNode) alpha = splitPoint.alpha; value = newDepth < cPly.ONE_PLY ? givesCheck ? -qsearch(pos, ss, ssPos + 1, -(alpha + 1), -alpha, cPly.DEPTH_ZERO, cTipoNodo.NO_PV, true) : -qsearch(pos, ss, ssPos + 1, -(alpha + 1), -alpha, cPly.DEPTH_ZERO, cTipoNodo.NO_PV, false) : -search(pos, ss, ssPos + 1, -(alpha + 1), -alpha, newDepth, !cutNode, cTipoNodo.NO_PV, false); } if (PvNode && (pvMove || (value > alpha && (RootNode || value < beta)))) value = newDepth < cPly.ONE_PLY ? givesCheck ? -qsearch(pos, ss, ssPos + 1, -beta, -alpha, cPly.DEPTH_ZERO, cTipoNodo.PV, true) : -qsearch(pos, ss, ssPos + 1, -beta, -alpha, cPly.DEPTH_ZERO, cTipoNodo.PV, false) : -search(pos, ss, ssPos + 1, -beta, -alpha, newDepth, false, cTipoNodo.PV, false); pos.DesMov(move); if (SpNode) { splitPoint.mutex.Bloquear(); bestValue = splitPoint.bestValue; alpha = splitPoint.alpha; } if (Signals.STOP || thisThread.IsCorte()) return cValoresJuego.CERO; if (RootNode) { int rmPos = Buscar(RootMoves, 0, RootMoves.Count, move); cRaizMov rm = RootMoves[rmPos]; if (pvMove || value > alpha) { rm.m_nVal = value; rm.extract_pv_from_tt(pos); if (!pvMove) ++BestMoveChanges; } else rm.m_nVal = -cValoresJuego.INFINITO; } if (value > bestValue) { bestValue = SpNode ? splitPoint.bestValue = value : value; if (value > alpha) { bestMove = SpNode ? splitPoint.bestMove = move : move; if (PvNode && value < beta) alpha = SpNode ? splitPoint.alpha = value : value; else { if (SpNode) splitPoint.m_bCorte = true; break; } } } if (!SpNode && cMotor.m_Threads.Count >= 2 && depth >= cMotor.m_Threads.minimumSplitDepth && (null == thisThread.m_SplitPointActivo || !thisThread.m_SplitPointActivo.allSlavesSearching) && thisThread.m_nSplitPointSize < cThreadBase.MAX_SPLITPOINTS_PER_THREAD) { thisThread.Split(pos, ss, ssPos, alpha, beta, ref bestValue, ref bestMove, depth, moveCount, mp, NT, cutNode); if (Signals.STOP || thisThread.IsCorte()) return cValoresJuego.CERO; if (bestValue >= beta) break; } } if (SpNode) return bestValue; if (0 == moveCount) bestValue = excludedMove != 0 ? alpha : inCheck ? cTypes.MateEnVs(ss[ssPos].ply) : DrawValue[pos.ColorMueve()]; else if (bestValue >= beta && !pos.IsCapturaOrPromocion(bestMove) && !inCheck) update_stats(pos, ss, ssPos, bestMove, depth, quietsSearched, quietCount - 1); cMotor.m_TablaHash.Save(posKey, value_to_tt(bestValue, ss[ssPos].ply), bestValue >= beta ? cBordes.BOUND_LOWER : PvNode && bestMove != 0 ? cBordes.BOUND_EXACT : cBordes.BOUND_UPPER, depth, bestMove, ss[ssPos].staticEval); return bestValue; }
//----------------------------------------------------------------------------------------------- public factor KBPsK(cPosicion pos) { bitbrd pawns = pos.PiezasColor(m_cFuerte, cPieza.PEON); colum pawnFile = cTypes.Columna(pos.GetList(m_cFuerte, cPieza.PEON)[0]); if ((pawnFile == COLUMNA.A || pawnFile == COLUMNA.H) && 0 == (pawns & ~cBitBoard.GetColumna(pawnFile))) { sq bishonCasillaPeon = pos.GetList(m_cFuerte, cPieza.ALFIL)[0]; sq queeningSq = cTypes.CasillaProxima(m_cFuerte, cTypes.CreaCasilla(pawnFile, FILA.F8)); sq kingSq = pos.GetRey(m_cDebil); if (cTypes.IsColorContrario(queeningSq, bishonCasillaPeon) && cBitBoard.Distancia(queeningSq, kingSq) <= 1) return cFactorEscala.TABLAS; } if ((pawnFile == COLUMNA.B || pawnFile == COLUMNA.G) && 0 == (pos.GetNumPiezas(cPieza.PEON) & ~cBitBoard.GetColumna(pawnFile)) && pos.MaterialPieza(m_cDebil) == 0 && pos.GetNum(m_cDebil, cPieza.PEON) >= 1) { sq weaksqPeon = cBitBoard.backmost_sq(m_cDebil, pos.PiezasColor(m_cDebil, cPieza.PEON)); sq strongKingSq = pos.GetRey(m_cFuerte); sq weakKingSq = pos.GetRey(m_cDebil); sq bishonCasillaPeon = pos.GetList(m_cFuerte, cPieza.ALFIL)[0]; if (cTypes.FilaProxima(m_cFuerte, weaksqPeon) == FILA.F7 && (pos.PiezasColor(m_cFuerte, cPieza.PEON) & cBitBoard.m_nCasillas[(weaksqPeon + cTypes.AtaquePeon(m_cDebil))]) != 0 && (cTypes.IsColorContrario(bishonCasillaPeon, weaksqPeon) || pos.GetNum(m_cFuerte, cPieza.PEON) == 1)) { int strongKingDist = cBitBoard.Distancia(weaksqPeon, strongKingSq); int weakKingDist = cBitBoard.Distancia(weaksqPeon, weakKingSq); if (cTypes.FilaProxima(m_cFuerte, weakKingSq) >= FILA.F7 && weakKingDist <= 2 && weakKingDist <= strongKingDist) return cFactorEscala.TABLAS; } } return cFactorEscala.NAN; }
//----------------------------------------------------------------------------------------------- public bool CheckMaterial(cPosicion posicion, color colr, val nMaterialPeones, int nPeones) { return posicion.MaterialPieza(colr) == nMaterialPeones && posicion.GetNum(colr, cPieza.PEON) == nPeones; }
//---------------------------------------------------------------------------------------------------------- public static void Init(cPosicion pos, cEvalInfo evalInfo, color colr) { color colorVS = (colr == cColor.BLANCO ? cColor.NEGRO : cColor.BLANCO); sq Down = (colr == cColor.BLANCO ? cCasilla.SUR : cCasilla.NORTE); evalInfo.m_Clavadas[colr] = pos.pinned_pieces(colr); bitbrd b = evalInfo.m_Ataques[colorVS][cPieza.REY] = pos.attacks_from_square_piecetype(pos.GetRey(colorVS), cPieza.REY); evalInfo.m_Ataques[colr][cPieza.NAN] = evalInfo.m_Ataques[colr][cPieza.PEON] = evalInfo.m_Peones.GetPeonesAtaques(colr); if (pos.GetNum(colr, cPieza.DAMA) != 0 && pos.MaterialPieza(colr) > cValoresJuego.DAMA_MJ + cValoresJuego.PEON_MJ) { evalInfo.m_ReyAcorralado[colorVS] = b | cBitBoard.Desplazamiento(b, Down); b &= evalInfo.m_Ataques[colr][cPieza.PEON]; evalInfo.m_AtaquesAlRey[colr] = (b != 0) ? cBitBoard.CountMax15(b) : 0; evalInfo.m_ZonaDelRey[colr] = evalInfo.m_PesoAtaquesAlRey[colr] = 0; } else { evalInfo.m_ReyAcorralado[colorVS] = 0; evalInfo.m_AtaquesAlRey[colr] = 0; } }
//----------------------------------------------------------------------------------------------------------------------------------- public static pnt EvalPeonImparable(cPosicion pos, color colr, cEvalInfo ei) { bitbrd b = ei.m_Peones.GetPeonesPasados(colr) | ei.m_Peones.GetPeonesACoronar(colr); if (0 == b || pos.MaterialPieza(cTypes.Contrario(colr)) != 0) return 0; return m_Imparable * (cTypes.FilaProxima(colr, cBitBoard.Adelantado(colr, b))); }
//----------------------------------------------------------------------------------------------------------------------------------- public static val Eval(cPosicion pos) { cEvalInfo eval = new cEvalInfo(); pnt nPuntos; pnt[] movilidad = new pnt[] { 0, 0 }; cThread thread = pos.ThreadActive(); nPuntos = pos.GetPuntosPeon() + (pos.ColorMueve() == cColor.BLANCO ? m_Tempo : -m_Tempo); eval.m_Material = cMaterial.Buscar(pos, thread.m_Material, thread.m_Finales); nPuntos += eval.m_Material.Valor(); if (eval.m_Material.FuncionEvaluacion()) return eval.m_Material.Eval(pos); eval.m_Peones = cBonusPeones.Buscar(pos, thread.m_TablaPeones); Init(pos, eval, cColor.BLANCO); Init(pos, eval, cColor.NEGRO); nPuntos += SetPesos(eval.m_Peones.GetValue(), m_Pesos[cEvalPesos.ESTRUCTURA_PEONES]); eval.m_Ataques[cColor.BLANCO][cPieza.NAN] |= eval.m_Ataques[cColor.BLANCO][cPieza.REY]; eval.m_Ataques[cColor.NEGRO][cPieza.NAN] |= eval.m_Ataques[cColor.NEGRO][cPieza.REY]; bitbrd[] areaMovilidad = new bitbrd[]{ ~(eval.m_Ataques[cColor.NEGRO][cPieza.PEON] | pos.PiezasColor(cColor.BLANCO, cPieza.PEON, cPieza.REY)), ~(eval.m_Ataques[cColor.BLANCO][cPieza.PEON] | pos.PiezasColor(cColor.NEGRO, cPieza.PEON, cPieza.REY)) }; nPuntos += EvalPiezas(pos, eval, movilidad, areaMovilidad, cPieza.CABALLO, cColor.BLANCO); nPuntos += cEval.SetPesos(movilidad[cColor.BLANCO] - movilidad[cColor.NEGRO], m_Pesos[cEvalPesos.MOVILIDAD]); nPuntos += EvalRey(pos, eval, cColor.BLANCO) - EvalRey(pos, eval, cColor.NEGRO); nPuntos += EvalAmenazas(pos, eval, cColor.BLANCO) - EvalAmenazas(pos, eval, cColor.NEGRO); nPuntos += EvalPeonesPasados(pos, eval, cColor.BLANCO) - EvalPeonesPasados(pos, eval, cColor.NEGRO); if (0 == pos.MaterialPieza(cColor.BLANCO) || 0 == pos.MaterialPieza(cColor.NEGRO)) nPuntos += EvalPeonImparable(pos, cColor.BLANCO, eval) - EvalPeonImparable(pos, cColor.NEGRO, eval); if (eval.m_Material.Peso() != 0) { int s = EvalEspacio(pos, eval, cColor.BLANCO) - EvalEspacio(pos, eval, cColor.NEGRO); nPuntos += cEval.SetPesos(s * eval.m_Material.Peso(), m_Pesos[cEvalPesos.ESPACIO]); } factor sf = cTypes.GetFinalJuego(nPuntos) > cValoresJuego.TABLAS ? eval.m_Material.FactorDeEscala(pos, cColor.BLANCO) : eval.m_Material.FactorDeEscala(pos, cColor.NEGRO); if (eval.m_Material.Fase() < cFaseJuego.MEDIO_JUEGO && pos.AlfilesOpuestos() && (sf == cFactorEscala.NORMAL || sf == cFactorEscala.PEON)) { if (pos.MaterialPieza(cColor.BLANCO) == cValoresJuego.ALFIL_MJ && pos.MaterialPieza(cColor.NEGRO) == cValoresJuego.ALFIL_MJ) { bool one_pawn = (pos.GetNum(cColor.BLANCO, cPieza.PEON) + pos.GetNum(cColor.NEGRO, cPieza.PEON) == 1); sf = one_pawn ? (8) : (32); } else sf = (50 * sf / cFactorEscala.NORMAL); } val v = cTypes.GetMedioJuego(nPuntos) * (eval.m_Material.Fase()) + cTypes.GetFinalJuego(nPuntos) * (cFaseJuego.MEDIO_JUEGO - eval.m_Material.Fase()) * sf / cFactorEscala.NORMAL; v /= (cFaseJuego.MEDIO_JUEGO); return pos.ColorMueve() == cColor.BLANCO ? v : -v; }