Sciweavers

849 search results - page 95 / 170
» Search allocation game
Sort
View
ACG
2006
Springer
15 years 5 months ago
A New Family of k-in-a-Row Games
First, this paper introduces a new family of k-in-a-row games, Connect(m, n, k, p, q). In Connect(m, n, k, p, q), two players alternately place p stones on an m × n board in each ...
I-Chen Wu, Dei-Yen Huang
IJCAI
1989
15 years 1 months ago
The Reason for the Benefits of Minimax Search
based on an abstract concept of quiescence. In the following we sketch this and a related model, describe the design of our experiments, and present the results of our simulation s...
Anton Scheucher, Hermann Kaindl
CG
2010
Springer
14 years 10 months ago
Scalability and Parallelization of Monte-Carlo Tree Search
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...
Amine Bourki, Guillaume Chaslot, Matthieu Coulm, V...
ACMACE
2006
ACM
15 years 5 months ago
Motivated reinforcement learning for non-player characters in persistent computer game worlds
Massively multiplayer online computer games are played in complex, persistent virtual worlds. Over time, the landscape of these worlds evolves and changes as players create and pe...
Kathryn Elizabeth Merrick, Mary Lou Maher
AAAI
2000
15 years 1 months ago
On Pruning Techniques for Multi-Player Games
Maxn (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow prunin...
Nathan R. Sturtevant, Richard E. Korf