On the complexity of searching game trees and other recursion trees (Q3813591)
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 4083350
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of searching game trees and other recursion trees |
scientific article; zbMATH DE number 4083350 |
Statements
On the complexity of searching game trees and other recursion trees (English)
0 references
1988
0 references
Game tree searching
0 references
artificial intelligence
0 references
decision analysis
0 references
binary bi-valued game trees
0 references
Schrüfers s-tree model
0 references
branching factors
0 references
Recursion trees
0 references
pruning
0 references
0.8441141247749329
0 references
0.8108785152435303
0 references
0.8009870648384094
0 references
