Sciweavers

109 search results - page 10 / 22
» How to Win a Game with Features
Sort
View
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
14 years 2 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer
ACMACE
2008
ACM
13 years 10 months ago
Motion controlled mobile 3D multiplayer gaming
Due to limitations in the user interface one of the oft cited most desirable features for mobile games is that they can be played using a single button. However, games using this ...
Fadi Chehimi, Paul Coulton
AIIDE
2007
13 years 10 months ago
A Believable Agent for First-Person Shooter Games
In this paper, we present a principled approach to constructing believable game players that relies on a cognitive architecture. The resulting agent is capable of playing the game...
Dongkyu Choi, Tolga Könik, Negin Nejati, Chun...
AUSAI
2001
Springer
14 years 11 days ago
An Investigation of an Adaptive Poker Player
: Other work has shown that adaptive learning can be highly successful in developing programs which are able to play games at a level similar to human players and, in some cases, e...
Graham Kendall, Mark Willdig
LPAR
2004
Springer
14 years 1 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel