Tree search breadth and depth reduction
Definition
A framework viewing tractable game search as the problem of shrinking two dimensions: breadth (how many actions to consider, pruned by a policy network) and depth (how far to search, truncated by a value function).
Cast within
No topic-region cast yet — this appears once Tree search breadth and depth reduction's compiled claims are aligned into a topic region's argument tree.
Claims mentioning Tree search breadth and depth reduction (3)
Your notes
Loading notes...