Questions tagged [tree-search]

For questions related to the tree search. As opposed to the graph search, a tree search does not use a closed list to keep track of the already visited nodes, so a tree search may visit the same nodes (or states) multiple times.

Filter by
Sorted by
Tagged with
5
votes
0answers
42 views

MCTS: How to choose the final action from the root

When the time allotted to Monte Carlo tree search runs out, what action should be chosen from the root? The original UCT paper (2006) says bestAction in their ...
3
votes
2answers
516 views

What is the difference between graph search and tree search? [duplicate]

First of all, there is a lot of misunderstanding about the graph search and tree search. The difference between these two is not about graphs and trees. They have two different algorithms. You can ...
9
votes
3answers
8k views

What is the difference between tree search and graph search?

I have read various answers to this question at different places, but I am still missing something. What I have understood is that a graph search holds a closed list, with all expanded nodes, so ...