Sciweavers

355 search results - page 36 / 71
» On Ramsey-type positional games
Sort
View
AAAI
2004
13 years 10 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
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
ACMACE
2007
ACM
14 years 25 days ago
Evaluating children's gaming experiences
We present a game for children, developed to inform children about global warming. The main focus is the evaluation of children's user experience with easy to use methods. We...
Regina Bernhaupt, Daniel Schwaiger, Stefan Riegler...
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 9 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm