Asymptotic properties of minimax trees and game-searching procedures (Q1145506): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56141856 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0004-3702(80)90037-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2017359019 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the branching factor of the alpha-beta pruning algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An analysis of alpha-beta pruning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Experiments With Some Programs That Search Game Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A minimax algorithm better than alpha-beta? / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:36, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Asymptotic properties of minimax trees and game-searching procedures |
scientific article |
Statements
Asymptotic properties of minimax trees and game-searching procedures (English)
0 references
1980
0 references
minimax trees
0 references
game-searching
0 references
search tree
0 references