Parallel randomized best-first minimax search. (Q1605282)
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 1768153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel randomized best-first minimax search. |
scientific article; zbMATH DE number 1768153 |
Statements
Parallel randomized best-first minimax search. (English)
0 references
15 July 2002
0 references
Two-player games
0 references
Heuristic search
0 references
Alpha-Beta
0 references
Best-first
0 references
Chess
0 references
Othello
0 references
Jamboree search
0 references
0.8744945526123047
0 references
0.8350149989128113
0 references
0.8328115344047546
0 references
0.8328114151954651
0 references
0.8290202617645264
0 references
