Searched refs:num_moves (Results 1 - 7 of 7) sorted by relevance
/macosx-10.10.1/Chess-310.6/sjeng/ |
H A D | proof.c | 141 int num_moves; local 154 num_moves = 0; 156 num_moves = numb_moves; 160 for (i = 0; i < num_moves; i++) 313 int num_moves; local 385 num_moves = 0; 387 num_moves = numb_moves; 392 for (i = 0; i < num_moves; i++) 411 num_moves = 0; 413 num_moves 508 int l, num_moves; local 769 int num_moves; local 1022 int num_moves; local [all...] |
H A D | search.c | 62 void order_moves (move_s moves[], int32_t move_ordering[], int32_t see_values[], int num_moves, int best) { argument 72 for (i = 0; i < num_moves; i++) { 161 for (i = 0; i < num_moves; i++) { 229 int num_moves, i; local 233 num_moves = 0; 243 num_moves = numb_moves; 248 for (i = 0; i < num_moves; i++) { 272 int num_moves, i, j; local 364 num_moves = 0; 370 num_moves 448 remove_one(int *marker, int32_t move_ordering[], int num_moves) argument 480 int num_moves, i, j; local 1067 int num_moves, i, j; local 1453 int num_moves; local 2015 int num_moves, i, j; local [all...] |
H A D | book.c | 179 int i, j, num_moves, random_number, num_replies; local 192 num_moves = numb_moves; 219 for (j = 0; j < num_moves; j++)
|
H A D | newbook.c | 165 int match, num_moves, i; local 274 num_moves = 0; 279 num_moves = numb_moves; 283 for (i = 0; i < num_moves; i++) 452 int num_moves, i; local 474 num_moves = 0; 479 num_moves = numb_moves; 481 for (i = 0; i < num_moves; i++)
|
H A D | segtb.c | 182 int num_moves; local 235 num_moves = numb_moves; 237 if(!num_moves) 275 int num_moves; local 313 num_moves = numb_moves; 315 if(num_moves == 0) 325 for(i = 0; i < num_moves; i++) 376 int num_moves; local 422 num_moves = numb_moves; 424 if(!num_moves) [all...] |
H A D | utils.c | 150 int i, num_moves, evasions, ambig, mate; local 207 num_moves = 0; 210 num_moves = numb_moves; 216 for(i = 0; i < num_moves; i++) 536 int num_moves; local 546 num_moves = numb_moves; 547 if ((bm >= 0) && (bm < num_moves)) 920 int num_moves, i; local 928 num_moves = 0; 930 num_moves [all...] |
H A D | protos.h | 49 void order_moves (move_s moves[], int32_t move_ordering[], int32_t see_values[], int num_moves, int best); 75 bool remove_one (int *marker, int32_t move_ordering[], int num_moves);
|
Completed in 91 milliseconds