Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with tree-search
Search options answers only
not deleted
user 1641
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.
1
vote
Accepted
Unclear definition of a "leaf" and diverging UTC values in the Monte Carlo Tree Search
Q1. When expanding the choices at the leaf node L, do I expand all, a few or just one child?
Expanding all nodes or expanding just one node are both possible. There are different advantages and disa …
- 10.5k
1
vote
Accepted
What should the initial UCT value be with MCTS, when leaf's simulation count is zero? Infinity?
Assigning a value of $\infty$ to unvisited nodes is indeed the "default" or most basic choice, and it indeed ensures that the search never visits a node for a second time if it also still has siblings …
- 10.5k
4
votes
Accepted
MCTS: How to choose the final action from the root
By far the most commonly used strategy is to select the child with the highest number of visits. This is as described in the 2008 paper you linked. It's also what's referred to as the "robust child" i …
- 10.5k