A solution to the GHI problem for best-first search (Q1589511): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Proof-number search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A solution to the GHI problem for best-first search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992828 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Best-first fixed-depth minimax algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A minimax algorithm better than alpha-beta? / rank | |||
Normal rank | |||
Revision as of 10:12, 3 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A solution to the GHI problem for best-first search |
scientific article |
Statements
A solution to the GHI problem for best-first search (English)
0 references
12 December 2000
0 references
graph-history interaction problem
0 references
best-first search
0 references
base-twin algorithm
0 references
