A Guided Tour of Artificial Intelligence Research 2020
DOI: 10.1007/978-3-030-06167-8_11
|View full text |Cite
|
Sign up to set email alerts
|

Artificial Intelligence for Games

Abstract: HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des labor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 74 publications
0
2
0
Order By: Relevance
“…In practice, many refinements have been developed in order to improve the performance of the minimax search algorithm. 3,4 Here, we concentrate on the classical minimax search algorithm, noting that the results of the paper would apply to any variant of the algorithm that guarantees the same outcome as classical minimax, such as alpha-beta pruning. 4 Many of the variants of the minimax search algorithm 4 would not necessarily return the same minimax value as classical minimax and therefore would demand separate study.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In practice, many refinements have been developed in order to improve the performance of the minimax search algorithm. 3,4 Here, we concentrate on the classical minimax search algorithm, noting that the results of the paper would apply to any variant of the algorithm that guarantees the same outcome as classical minimax, such as alpha-beta pruning. 4 Many of the variants of the minimax search algorithm 4 would not necessarily return the same minimax value as classical minimax and therefore would demand separate study.…”
Section: Introductionmentioning
confidence: 99%
“…The value of the root is determined by computing a score for each leaf value using a static evaluation function and backing up these scores using the minimax rule. In practice, many refinements have been developed in order to improve the performance of the minimax search algorithm 3,4 …”
Section: Introductionmentioning
confidence: 99%