The *-minimax search procedure for trees containing chance nodes (Q1050777): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3856120 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An analysis of alpha-beta pruning / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the branching factor of the alpha-beta pruning algorithm / rank | |||
Normal rank | |||
Latest revision as of 08:20, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The *-minimax search procedure for trees containing chance nodes |
scientific article |
Statements
The *-minimax search procedure for trees containing chance nodes (English)
0 references
1983
0 references
game trees with probability nodes
0 references
minimax trees
0 references
left-to-right depth- first algorithm
0 references
0 references
