533 search results - page 4 / 107 » Playing games with approximation algorithms |
AAAI
2010
13 years 7 months ago
2010
We develop a method for detecting symmetries in arbitrary games and exploiting these symmetries when using tree search to play the game. Games in the General Game Playing domain a...
CG
2006
Springer
13 years 9 months ago
2006
Springer
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We use case injected genetic algorithms to learn to competently play computer strategy games. Such games are characterized by player decision in anticipation of opponent ...
SAGT
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
NETGAMES
2006
ACM
13 years 11 months ago
2006
ACM
Broadcasting all state changes to every player of a massively multiplayer game is not a viable solution. To successfully overcome the challenge of scale, massively multiplayer gam...