GO Is Polynomial-Space Hard-Reference-Cited by-同舟云学术

GO Is Polynomial-Space Hard

Published:1980-04 Issue:2 Volume:27 Page:393-401
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Lichtenstein David¹,Sipser Michael²

Affiliation:

1. Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA

2. IBM Research Laboratory, 5600 Cottle Road, San Jose, CA and University of California, Berkeley, California

Abstract

It is shown that, given an arbitrary GO position on an n × n board, the problem of determining the winner is Pspace hard. New techniques are exploited to overcome the difficulties arising from the planar nature of board games. In particular, it is proved that GO is Pspace hard by reducing a Pspace-complete set, TQBF, to a game called generalized geography, then to a planar version of that game, and finally to GO.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/322186.322201

Reference10 articles.

1. BERLEKAMP E R CONWAY J AND GUY R Wmmng Ways Academic Press New York. To appear BERLEKAMP E R CONWAY J AND GUY R Wmmng Ways Academic Press New York. To appear

2. BLOCK H C Axioms for GO SIGART Newsletter (ACM) 51 (Aprd 1975) p 13 BLOCK H C Axioms for GO SIGART Newsletter (ACM) 51 (Aprd 1975) p 13

3. EVEN S AND TAR JAN R E A combmatonal problem whtch is complete in polynomial space J A CM 23. 4 (Oct 1976) 710--719 10.1145/321978.321989 EVEN S AND TAR JAN R E A combmatonal problem whtch is complete in polynomial space J A CM 23. 4 (Oct 1976) 710--719 10.1145/321978.321989

Cited by 105 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Nimber-preserving reduction: Game secrets and homomorphic Sprague-Grundy theorem;Theoretical Computer Science;2024-07

2. Feedback game on 3-chromatic Eulerian triangulations of surfaces;Discrete Applied Mathematics;2024-04

3. “Intelligent Heuristics Are the Future of Computing”;ACM Transactions on Intelligent Systems and Technology;2023-11-14

4. Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies;International Journal of Game Theory;2023-10-10

5. Bichromatic coloring game on triangulations;RAIRO - Operations Research;2023-09