Game Tree Search is a computational method within the broader category of game-playing algorithms that systematically explores the nodes and edges of a game tree to identify optimal or near-optimal moves by evaluating possible future states and backtracking utility values from terminal positions.
206
Publications
10.6K
Citations
336
Authors
146
Institutions
Publications per year
2017–2026
34
Parents
Publications
206
Simulation-based approach to general game playing
Hilmar Finnsson, Yngvi Björnsson · 2008 · 241 citations
1–5 of 206
Authors
336
- PC
11
h-index
- MH
10
h-index
- EJ
9
h-index
- JS
8
h-index
- DN
8
h-index
1–5 of 336
Institutions
146
University of Alberta
Edmonton, Canada
20 h-index
45 publications
2.5K citations
Maastricht University
Maastricht, The Netherlands
12 h-index
28 publications
2.3K citations
University of Maryland, College Park
College Park, United States
11 h-index
18 publications
447 citations
University of York
York, United Kingdom
9 h-index
25 publications
645 citations
Drexel University
Philadelphia, United States
6 h-index
10 publications
322 citations
University of California, Los Angeles
Los Angeles, United States
6 h-index
7 publications
385 citations
Ritsumeikan University
Kyoto, Japan
5 h-index
25 publications
648 citations
University of California, Berkeley
Berkeley, United States
5 h-index
11 publications
530 citations
1–8 of 146
Venues
- ICGA Journal
15 publications · 378 citations
13
h-index
- Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment
11 publications · 535 citations
11
h-index
- IEEE Transactions on Computational Intelligence and AI in Games
11 publications · 3.6K citations
11
h-index
- International Joint Conference on Artificial Intelligence
Conference · 10 publications · 308 citations
10
h-index
- arXiv (Cornell University)
Repository · 8 publications · 131 citations
8
h-index
1–5