Partial order bounding: A new approach to evaluation in game tree search (Q5941319)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partial order bounding: A new approach to evaluation in game tree search |
scientific article; zbMATH DE number 1635484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partial order bounding: A new approach to evaluation in game tree search |
scientific article; zbMATH DE number 1635484 |
Statements
Partial order bounding: A new approach to evaluation in game tree search (English)
0 references
20 August 2001
0 references
game tree search
0 references
evaluation functions
0 references
partial order evaluation
0 references
partial order bounding
0 references
computer Go
0 references
Semeai
0 references
0.8876917
0 references
0.8387212
0 references
0.8364428
0 references
0 references
0.8304893
0 references
0 references
0.82807666
0 references
