Lines Matching defs:depth
226 void perft (int depth) {
235 /* return if we are at the maximum depth: */
236 if (!depth) {
247 /* loop through the moves at the current depth: */
255 perft (depth-1);
266 int32_t qsearch (int alpha, int beta, int depth) {
316 if (depth <= 0 || ply > maxdepth)
388 score = -qsearch (-beta, -alpha, depth-1);
410 /* don't update the history heuristic scores here, since depth is messed
475 int32_t search (int alpha, int beta, int depth, int is_null) {
566 if (ply < maxdepth+1 && incheck && ((ply <= i_depth*2) || (depth == 0)))
568 depth++;
573 && (depth <= 2)
578 depth++;
584 if (depth <= 0 || ply >= maxdepth)
620 switch (ProbeTT(&bound, alpha, beta, &best, &threat, &donull, depth))
692 && ((phase != Endgame) || ((phase == Endgame) && (depth <= 6)))
707 score = -search(-beta, -beta+1, ((depth > 3) ? depth-2-1 : depth-1-1), SINGLE);
710 if (depth > 11)
711 score = -search(-beta, -beta+1, depth-4-1, SINGLE);
712 else if (depth > 6)
713 score = -search(-beta, -beta+1, depth-3-1, SINGLE);
715 score = -search(-beta, -beta+1, depth-2-1, SINGLE);
734 StoreTT(score, alpha, beta, 500, 0, depth);
742 depth++;
750 depth++;
765 if (!extend && depth == 3 && fscore <= alpha)
766 depth = 2;
770 if (!extend && depth == 2 && fscore <= alpha)
778 if (!extend && depth == 1 && fscore <= alpha)
793 if ((Variant == Suicide) && num_moves == 1) depth++;
794 else if ((Variant == Losers) && legalmoves == 1) depth++;
824 || (Variant == Losers)) && (depth < 3) &&
835 && (depth > 1) /* more than pre-frontier nodes */
844 if ((moves[i].from == 0) && (depth == 1) && (incheck == 0) && cfg_cutdrop)
875 score = -search (-beta, -alpha, depth+extend-1, NONE);
880 score = -search (-alpha-1, -alpha, depth+extend-1, NONE);
887 score = -search(-beta, -score, depth+extend-1, NONE);
926 history_h[moves[i].from][moves[i].target] += depth * depth;
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);
1054 StoreTT(best_score, -INF, -INF, sbest, threat, depth);/*store lowbound*/
1062 move_s search_root (int originalalpha, int originalbeta, int depth) {
1111 depth++;
1196 root_score = -search (-beta, -alpha, depth-1, NONE);
1246 root_score = -search (-alpha-1, -alpha, depth-1, NONE);
1263 root_score = -search(-beta, -root_score, depth-1, NONE);
1367 history_h[moves[i].from][moves[i].target] += depth * depth;
2012 void tree (int depth, int indent, FILE *output, char *disp_b) {
2022 /* return if we are at the maximum depth: */
2023 if (!depth) {
2033 /* loop through the moves at the current depth: */
2052 tree (depth-1, indent+2, output, disp_b);