The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Complexity of decision problems based on finite two-person perfect-information games
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Fast algorithms for finding randomized strategies in game trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A hierarchical approach to computer Hex
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Games solved: now and in the future
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Are Bees Better than Fruitflies?
AI '00 Proceedings of the 13th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
A note on first-order projections and games
Theoretical Computer Science
The complexity of problems in systems of communicating sequential processes (Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The pebbling problem is complete in polynomial space
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Classes of pebble games and complete problems
ACM '78 Proceedings of the 1978 annual conference - Volume 2
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Complexity of question/answer games
Theoretical Computer Science
Theoretical Computer Science
UNO is hard, even for a single player
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
An extension of the h-search algorithm for artificial hex players
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Unordered constraint satisfaction games
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
UNO is hard, even for a single player
Theoretical Computer Science
| Hi-index | 0.01 |
This paper considers a generalization, called the Shannon switching game on vertices, of a familiar board game called Hex. It is shown that determining who wins such a game if each player plays perfectly is very hard; in fact, if this game problem is solvable in polynomial time, then any problem solvable in polynomial space is solvable in polynomial time. This result suggests that the theory of combinational games is difficult.