Searched refs:root_moves (Results 1 – 13 of 13) sorted by relevance
75 root_moves[mvp].move = rmoves[mvp]; in RootMoveList()149 root_moves[mvp].path = tree->pv[1]; in RootMoveList()150 root_moves[mvp].path.pathv = value; in RootMoveList()151 root_moves[mvp].status = 0; in RootMoveList()152 root_moves[mvp].bm_age = 0; in RootMoveList()166 if (root_moves[mvp].path.pathv < root_moves[mvp + 1].path.pathv) { in RootMoveList()167 rtemp = root_moves[mvp]; in RootMoveList()168 root_moves[mvp] = root_moves[mvp + 1]; in RootMoveList()169 root_moves[mvp + 1] = rtemp; in RootMoveList()189 root_moves[0].path.pathv -= 2000000; in RootMoveList()[all …]
189 root_moves[0].path = tree->pv[0]; in Iterate()337 root_moves[i].path.pathv = -MATE; in Iterate()338 root_moves[i].status &= 4; in Iterate()394 root_moves[i] = root_moves[i - 1]; in Iterate()395 root_moves[0] = temp_rm; in Iterate()473 root_moves[i].status &= 3; in Iterate()474 if (root_moves[i].bm_age) in Iterate()475 root_moves[i].bm_age--; in Iterate()476 if (root_moves[i].bm_age) in Iterate()477 root_moves[i].status |= 4; in Iterate()[all …]
714 root_moves[best].path = tree->pv[1]; in SearchMoveList()715 root_moves[best].path.pathv = alpha; in SearchMoveList()723 t = root_moves[best]; in SearchMoveList()725 root_moves[i] = root_moves[i - 1]; in SearchMoveList()726 root_moves[0] = t; in SearchMoveList()733 if (value <= root_moves[i].path.pathv) { in SearchMoveList()735 value = root_moves[i].path.pathv; in SearchMoveList()737 tree->pv[0] = root_moves[i].path; in SearchMoveList()739 t = root_moves[i]; in SearchMoveList()741 root_moves[j] = root_moves[j - 1]; in SearchMoveList()[all …]
425 if (!(root_moves[which].status & 8)) { in NextRootMove()427 if (root_moves[which].move != search_move) { in NextRootMove()428 root_moves[which].status |= 8; in NextRootMove()432 tree->curmv[1] = root_moves[which].move; in NextRootMove()433 root_moves[which].status |= 8; in NextRootMove()494 if (root_moves[which].status & 4) in NextRootMove()545 if (!(root_moves[which].status & 8)) in NextRootMoveParallel()547 if (which < n_root_moves && !(root_moves[which].status & 4)) in NextRootMoveParallel()
106 MakeMove(tree, 1, wtm, root_moves[im].move); in Book()188 MakeMove(tree, 1, wtm, root_moves[im].move); in Book()202 tree->curmv[1] = root_moves[im].move; in Book()203 if (!Captured(root_moves[im].move)) { in Book()221 book_moves[nmoves] = root_moves[im].move; in Book()662 root_moves[i].move = book_moves[i]; in Book()663 root_moves[i].status = 0; in Book()697 if (root_moves[i].move == book_moves[j]) in Book()698 root_moves[i].move = 0; in Book()700 if (root_moves[i].move != 0) in Book()[all …]
214 if (root_moves[i].status & 8) in TimeCheck()216 if (ndone == 1 && !(root_moves[0].status & 1)) in TimeCheck()
328 if (root_moves[i].move == tree->pv[0].path[1]) { in Annotate()330 root_moves[i] = root_moves[i + 1]; in Annotate()350 root_moves[0].move = move; in Annotate()351 root_moves[0].status = 0; in Annotate()
78 if (!(root_moves[i].status & 8)) in Interrupt()
418 if (root_moves[i].status & 8) in ComputeDifficulty()445 if (root_moves[i].bm_age == 3) in ComputeDifficulty()952 if (root_moves[i].status & 4) in DisplayPV()2280 if (tree->pv[1].path[1] == root_moves[i].move) in Output()2282 root_moves[i].path = tree->pv[1]; in Output()2283 root_moves[i].bm_age = 4; in Output()
849 if (root_moves[which].move == child->curmv[ply]) { in CopyToParent()850 root_moves[which].status &= 7; in CopyToParent()
152 extern ROOT_MOVE root_moves[256];
560 ROOT_MOVE root_moves[256]; variable
1317 static void root_moves(Position *b, Move *move) in root_moves() function1348 root_moves(b, &move); in is_checkmate()1638 root_moves(b, move); in mtd_search()