Sciweavers

31 search results - page 1 / 7
» A Comparison of Algorithms for Multi-player Games
Sort
View
AAAI
2000
13 years 5 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
CW
2005
IEEE
13 years 10 months ago
On a Serverless Networked Virtual Ball Game for Multi-Player
This paper studies the way to improve consistency of states in a ball-game typed Distributed Virtual Environment (DVE) with lag, in peer-to-peer (P2P) architecture. That is, we ar...
Yoshihiro Kawano, Tatsuhiro Yonekura
CG
2002
Springer
13 years 4 months ago
A Comparison of Algorithms for Multi-player Games
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
Nathan R. Sturtevant
CEC
2009
IEEE
13 years 2 months ago
Optimisation of the Beer Distribution Game with complex customer demand patterns
This paper examines a simulation of the Beer Distribution Game and a number of optimisation approaches to this game. This well known game was developed at MIT in the 1960s and has ...
Hongliang Liu, Enda Howley, Jim Duggan
UAI
2004
13 years 5 months ago
Computing Best-Response Strategies in Infinite Games of Incomplete Information
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
Daniel M. Reeves, Michael P. Wellman