We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
Guillaume Chaslot, Mark H. M. Winands, H. Jaap van...
Recent work has shown the promise in using local-search “probes” as a basis for directing a backtracking-based refinement search. In this approach, the decision about the next...
Alexander Nareyek, Stephen F. Smith, Christian M. ...
—The performance of maximum likelihood searches can be boosted by using the most parsimonious tree as a starting point for the search. The time spent in performing the parsimony ...