Optimistic Monte Carlo tree search with sampled information relaxation dual bounds (Q5144789)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7298144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimistic Monte Carlo tree search with sampled information relaxation dual bounds |
scientific article; zbMATH DE number 7298144 |
Statements
Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds (English)
0 references
19 January 2021
0 references
Monte Carlo tree search
0 references
dynamic programming
0 references
information relaxation
0 references
0 references
0 references
0.7590651512145996
0 references
0.7552339434623718
0 references
0.7473219633102417
0 references
0.7456042766571045
0 references
