Lines Matching defs:beta
266 int32_t qsearch (int alpha, int beta, int depth) {
268 /* perform a quiscense search on the current node using alpha-beta with
327 switch (QProbeTT(&bound, alpha, beta, &best))
335 if (bound < beta)
336 beta = bound;
339 if (bound >= beta)
353 if (standpat >= beta) {
355 QStoreTT(standpat, originalalpha, beta, 500);
388 score = -qsearch (-beta, -alpha, depth-1);
415 if (score >= beta)
417 QStoreTT(score, originalalpha, beta, i);
443 QStoreTT(alpha, originalalpha, beta, best);
475 int32_t search (int alpha, int beta, int depth, int is_null) {
477 /* search the current node using alpha-beta with negamax search */
590 score = qsearch (alpha, beta, maxdepth);
620 switch (ProbeTT(&bound, alpha, beta, &best, &threat, &donull, depth))
628 if (bound < beta)
629 beta = bound;
633 if (bound >= beta)
707 score = -search(-beta, -beta+1, ((depth > 3) ? depth-2-1 : depth-1-1), SINGLE);
711 score = -search(-beta, -beta+1, depth-4-1, SINGLE);
713 score = -search(-beta, -beta+1, depth-3-1, SINGLE);
715 score = -search(-beta, -beta+1, depth-2-1, SINGLE);
729 if (score >= beta)
734 StoreTT(score, alpha, beta, 500, 0, depth);
875 score = -search (-beta, -alpha, depth+extend-1, NONE);
885 if ((score > alpha) && (score < beta))
887 score = -search(-beta, -score, depth+extend-1, NONE);
923 if (score >= beta) {
981 StoreTT(score, originalalpha, beta, i, threat, depth);
1007 StoreTT(INF-ply, originalalpha, beta, 0, threat, depth);
1018 StoreTT(-INF+ply, originalalpha, beta, 0, threat, depth);
1023 StoreTT(0, originalalpha, beta, 0, threat, depth);
1029 StoreTT(INF-ply, originalalpha, beta, 0, threat, depth);
1047 StoreTT(best_score, originalalpha, beta, sbest, threat, depth);
1052 StoreTT(best_score, originalalpha, beta, sbest, threat, depth);
1064 /* search the root node using alpha-beta with negamax search */
1070 int alpha, beta;
1080 beta = originalbeta;
1196 root_score = -search (-beta, -alpha, depth-1, NONE);
1201 if (root_score >= beta)
1249 if ((root_score > alpha) && (root_score < beta) && !time_exit)
1263 root_score = -search(-beta, -root_score, depth-1, NONE);
1286 if (root_score >= beta && !time_exit)
1380 if (cur_score >= beta) return best_move;
1447 int alpha, beta;
1696 beta = temp_score + (Variant == Normal ? 35 : 100);
1699 temp_move = search_root (alpha, beta, i_depth);
1709 beta = cur_score;
1714 temp_move = search_root (alpha, beta, i_depth);
1721 beta = cur_score;
1726 temp_move = search_root (alpha, beta, i_depth);
1731 else if (cur_score >= beta && !time_exit)
1737 else if (cur_score >= beta && !time_exit) /* fail high */
1743 beta = cur_score + (Variant == Normal ? 350 : 600);
1748 temp_move = search_root (alpha, beta, i_depth);
1750 if (cur_score >= beta && !time_exit)
1756 beta = +(INF+1);
1761 temp_move = search_root (alpha, beta, i_depth);