• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /macosx-10.9.5/Chess-310.5/sjeng/

Lines Matching refs:alpha

266 int32_t qsearch (int alpha, int beta, int depth) {
268 /* perform a quiscense search on the current node using alpha-beta with
325 originalalpha = alpha;
327 switch (QProbeTT(&bound, alpha, beta, &best))
333 if (bound <= alpha)
341 if (bound > alpha)
342 alpha = bound;
358 else if (standpat > alpha) {
359 alpha = standpat;
366 delta = alpha-150-standpat;
388 score = -qsearch (-beta, -alpha, depth-1);
406 /* check our current score vs. alpha: */
407 if (score > alpha && legal_move)
421 alpha = score;
438 /* we tried all moves and none were good...sack to alpha */
443 QStoreTT(alpha, originalalpha, beta, best);
444 return alpha;
475 int32_t search (int alpha, int beta, int depth, int is_null) {
477 /* search the current node using alpha-beta with negamax search */
526 originalalpha = alpha;
590 score = qsearch (alpha, beta, maxdepth);
620 switch (ProbeTT(&bound, alpha, beta, &best, &threat, &donull, depth))
626 if (bound <= alpha)
635 if (bound > alpha)
636 alpha = bound;
734 StoreTT(score, alpha, beta, 500, 0, depth);
765 if (!extend && depth == 3 && fscore <= alpha)
770 if (!extend && depth == 2 && fscore <= alpha)
778 if (!extend && depth == 1 && fscore <= alpha)
865 )) > alpha)
875 score = -search (-beta, -alpha, depth+extend-1, NONE);
880 score = -search (-alpha-1, -alpha, depth+extend-1, NONE);
885 if ((score > alpha) && (score < beta))
919 /* check our current score vs. alpha: */
920 if (score > alpha && legal_move) {
986 alpha = score;
1064 /* search the root node using alpha-beta with negamax search */
1070 int alpha, beta;
1079 alpha = originalalpha;
1196 root_score = -search (-beta, -alpha, depth-1, NONE);
1211 else if (root_score <= alpha)
1246 root_score = -search (-alpha-1, -alpha, depth-1, NONE);
1249 if ((root_score > alpha) && (root_score < beta) && !time_exit)
1266 if (root_score > alpha && !time_exit)
1318 /* check our current score vs. alpha: */
1319 if (root_score > alpha && legal_move) {
1369 alpha = root_score;
1372 cur_score = alpha;
1384 post_thinking (alpha);
1447 int alpha, beta;
1695 alpha = temp_score - (Variant == Normal ? 35 : 100);
1699 temp_move = search_root (alpha, beta, i_depth);
1703 if (cur_score <= alpha) failed = 1;
1706 if (cur_score <= alpha && !time_exit) /* fail low */
1708 alpha = cur_score - (Variant == Normal ? 350 : 600);
1714 temp_move = search_root (alpha, beta, i_depth);
1716 if (cur_score > alpha && !time_exit) failed = 0;
1718 if (cur_score <= alpha && !time_exit)
1720 alpha = -(INF+1);
1726 temp_move = search_root (alpha, beta, i_depth);
1728 if (cur_score > alpha && !time_exit) failed = 0;
1742 alpha = cur_score - 1;
1748 temp_move = search_root (alpha, beta, i_depth);
1755 alpha = cur_score - 1;
1761 temp_move = search_root (alpha, beta, i_depth);
1764 else if (cur_score <= alpha && !time_exit)