Sciweavers

3780 search results - page 62 / 756
» Algorithms for Game Metrics
Sort
View
ACG
2003
Springer
14 years 2 months ago
The 7-piece Perfect Play Lookup Database for the Game of Checkers
Many research teams and individuals have computed endgame databases for the game of chess which use the distance-to-mate metric, enabling their software to forecast the number of m...
Ed Trice, Gil Dodgen
INFSOF
2007
185views more  INFSOF 2007»
13 years 8 months ago
Evaluation of object-oriented design patterns in game development
The use of object-oriented design patterns in game development is being evaluated in this paper. Games’ quick evolution, demands great flexibility, code reusability and low mai...
Apostolos Ampatzoglou, Alexander Chatzigeorgiou
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
14 years 2 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
CG
2004
Springer
14 years 16 days ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li
LICS
2000
IEEE
14 years 1 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger