Sciweavers

16 search results - page 1 / 4
» On Pruning Techniques for Multi-Player Games
Sort
View
61
Voted
AAAI
2000
14 years 11 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
AAAI
2006
14 years 11 months ago
Properties of Forward Pruning in Game-Tree Search
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...
Yew Jin Lim, Wee Sun Lee
ACG
2006
Springer
15 years 3 months ago
Move-Pruning Techniques for Monte-Carlo Go
Abstract. Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers stati...
Bruno Bouzy
54
Voted
AAAI
2006
14 years 11 months ago
RankCut - A Domain Independent Forward Pruning Method for Games
Forward pruning, also known as selective search, is now employed in many strong game-playing programs. In this paper, we introduce RankCut
Yew Jin Lim, Wee Sun Lee
CG
2004
Springer
15 years 3 months ago
Current Challenges in Multi-player Game Search
Abstract. Years of work have gone into algorithms and optimizations for twoplayer perfect-information games such as Chess and Checkers. It is only more recently that serious resear...
Nathan R. Sturtevant