An incremental negamax algorithm (Q2639785): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nim games with arbitrary periodic moving orders / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3904064 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Searching for an optimal path in a tree with random costs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pathology on game trees revisited, and an alternative to minimaxing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the nature of pathology in game searching / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:15, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An incremental negamax algorithm |
scientific article |
Statements
An incremental negamax algorithm (English)
0 references
1990
0 references
game trees
0 references
erroneous evaluation functions
0 references
minimax algorithm
0 references
incremental negamax algorithm
0 references