Sciweavers

57 search results - page 2 / 12
» The Nakamura numbers for computable simple games
Sort
View
BCSHCI
2007
13 years 10 months ago
Habitats: a simple way to bridge artifacts, professions, and theories in ubiquitous design
This paper briefly shows how product designers as well as information system designers may use the habitat framework as a tool to inform their understanding of the pervasive compu...
Martin Brynskov, Gunnar Kramp
AAAI
2006
13 years 10 months ago
On Strictly Competitive Multi-Player Games
We embark on an initial study of a new class of strategic (normal-form) games, so-called ranking games, in which the payoff to each agent solely depends on his position in a ranki...
Felix Brandt, Felix A. Fischer, Yoav Shoham
AI
2002
Springer
13 years 8 months ago
A hierarchical approach to computer Hex
Hex is a beautiful game with simple rules and a strategic complexity comparable to that of Chess and Go. The massive game-tree search techniques developed mostly for Chess and suc...
Vadim V. Anshelevich
DIGRA
2005
Springer
14 years 2 months ago
Shadowplay: Simulated Illumination in Game Worlds
Despite the fact that there are currently a number of enjoyable digital games in which light plays a key role, we lack a vocabulary with which to discuss simulated illumination in...
Simon Niedenthal
AIIDE
2007
13 years 11 months ago
A Demonstration of SQUEGE: A CRPG Sub-Quest Generator
Scripting the plot in a computer role-playing game requires a large number of scripts that are difficult to program, track and maintain. Game adventures often include simple plot...
Curtis Onuczko, Duane Szafron, Jonathan Schaeffer,...