On the public citation graph

Hex ist PSPACE-vollst�ndig

https://doi.org/10.1007/bf00288964
0 signed · 109 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-322-98457-9openalex-snapshot
Mathematische Rätsel und Probleme
inferredcites →https://doi.org/10.1007/bf00288536openalex-snapshot
Gobang ist PSPACE-vollst�ndig
inferredcites →https://doi.org/10.1016/0022-0000(78)90045-4openalex-snapshot
On the complexity of some two-person perfect-information games
inferredcites →https://doi.org/10.1109/sfcs.1978.17openalex-snapshot
GO is pspace hard
inferredcites →https://doi.org/10.1109/sfcs.1978.36openalex-snapshot
The complexity of checkers on an N × N board
inferredcites →https://doi.org/10.1145/321850.321852openalex-snapshot
Efficient Planarity Testing
inferredcites →https://doi.org/10.1145/321978.321989openalex-snapshot
A Combinatorial Problem Which Is Complete in Polynomial Space
inferredcites →https://doi.org/10.1145/800116.803754openalex-snapshot
A combinatorial problem which is complete in polynomial space
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118032497.ch17openalex-snapshot
Miscellaneous Problems
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_23openalex-snapshot
Computing a perfect strategy for n×n chess requires time exponential in n
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_3openalex-snapshot
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
inferred← citeshttps://doi.org/10.1007/978-0-387-35706-5_17openalex-snapshot
Solving 7×7 Hex: Virtual Connections and Game-State Reduction
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_31openalex-snapshot
Positional Games and QBF: The Corrective Encoding
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_23openalex-snapshot
The Largest Connected Subgraph Game
inferred← citeshttps://doi.org/10.1007/978-3-030-87626-5_3openalex-snapshot
Quantified Boolean Solving for Achievement Games
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_38openalex-snapshot
Backgammon Is Hard
inferred← citeshttps://doi.org/10.1007/978-3-031-54968-7_12openalex-snapshot
Implicit QBF Encodings for Positional Games
inferred← citeshttps://doi.org/10.1007/978-3-319-00119-7_5openalex-snapshot
The Complexity of Computations
inferred← citeshttps://doi.org/10.1007/978-3-319-09165-5_15openalex-snapshot
Havannah and TwixT are PSPACE-complete
inferred← citeshttps://doi.org/10.1007/978-3-319-27992-3_15openalex-snapshot
Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game
inferred← citeshttps://doi.org/10.1007/978-3-319-57969-6_1openalex-snapshot
NeuroHex: A Deep Q-learning Hex Agent
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_27openalex-snapshot
A Third-Order Bounded Arithmetic Theory for PSPACE
inferred← citeshttps://doi.org/10.1007/978-3-540-74565-5_29openalex-snapshot
Learning How to Play Hex
inferred← citeshttps://doi.org/10.1007/978-3-540-75538-8_10openalex-snapshot
Automatic Strategy Verification for Hex
inferred← citeshttps://doi.org/10.1007/978-3-540-77105-0_49openalex-snapshot
A PSPACE-complete Sperner Triangle Game
inferred← citeshttps://doi.org/10.1007/978-3-642-12993-3_9openalex-snapshot
Hex, Braids, the Crossing Rule, and XH-Search
inferred← citeshttps://doi.org/10.1007/978-3-642-17928-0_1openalex-snapshot
Solving Hex: Beyond Humans
inferred← citeshttps://doi.org/10.1007/978-3-642-36899-8_34openalex-snapshot
Remarks on History and Presence of Game Tree Search and Research
inferred← citeshttps://doi.org/10.1007/978-3-7643-7400-6_5openalex-snapshot
Dead Cell Analysis in Hex and the Shannon Game
inferred← citeshttps://doi.org/10.1007/bf01756027openalex-snapshot
Single-suit two-person card play
inferred← citeshttps://doi.org/10.1007/s00453-022-00973-5openalex-snapshot
The Largest Connected Subgraph Game
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90185-vopenalex-snapshot
Shannon-like games are difficult
inferred← citeshttps://doi.org/10.1016/0095-8956(82)90058-2openalex-snapshot
Theory of annihilation games—I
inferred← citeshttps://doi.org/10.1016/0097-3165(81)90016-9openalex-snapshot
Computing a perfect strategy for n × n chess requires time exponential in n
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90017-qopenalex-snapshot
A difficulty in particular Shannon-like games
inferred← citeshttps://doi.org/10.1016/0196-6774(83)90019-6openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90254-dopenalex-snapshot
The complexity of coloring games on perfect graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90356-xopenalex-snapshot
Geography
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90131-7openalex-snapshot
The Othello game on an n × n board is PSPACE-complete
inferred← citeshttps://doi.org/10.1016/b978-0-12-372512-7.00020-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/b978-0-444-53766-9.00015-xopenalex-snapshot
Theory of Combinatorial Games
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50006-0openalex-snapshot
Machine Models and Simulations
inferred← citeshttps://doi.org/10.1016/j.dam.2003.11.011openalex-snapshot
TantrixTM rotation puzzles are intractable
inferred← citeshttps://doi.org/10.1016/j.dam.2025.03.010openalex-snapshot
PSPACE-completeness of k -Atropos
inferred← citeshttps://doi.org/10.1016/j.disc.2006.01.029openalex-snapshot
Hex and combinatorics
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113570openalex-snapshot
Incidence, a scoring positional game on graphs
inferred← citeshttps://doi.org/10.1016/j.entcom.2012.10.004openalex-snapshot
Square++: Making a connection game win-lose complementary and playing-fair
inferred← citeshttps://doi.org/10.1016/j.geb.2009.04.019openalex-snapshot
Topological games at Princeton, a mathematical memoir
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.105995openalex-snapshot
QUIXO is EXPTIME-complete
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.042openalex-snapshot
Solving 7×7 Hex with domination, fill-in, and virtual connections
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.05.032openalex-snapshot
An algorithmic analysis of the Honey-Bee game
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.033openalex-snapshot
On the complexity of connection games
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.04.007openalex-snapshot
NP -completeness of the game Kingdomino TM
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.034openalex-snapshot
Rikudo is NP-complete
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.014openalex-snapshot
The Maker-Breaker Largest Connected Subgraph game
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114627openalex-snapshot
The computational complexity of forced capture Hnefatafl
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114636openalex-snapshot
Nimber-preserving reduction: Game secrets and homomorphic Sprague-Grundy theorem
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00152-7openalex-snapshot
Games solved: Now and in the future
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00154-0openalex-snapshot
A hierarchical approach to computer Hex
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00062-1openalex-snapshot
Recent results and questions in combinatorial game complexities
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00179-7openalex-snapshot
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete
inferred← citeshttps://doi.org/10.1017/9781316135167.013openalex-snapshot
The Game of Hex: The Hierarchical Approach
inferred← citeshttps://doi.org/10.1080/00029890.2007.11920428openalex-snapshot
Random-Turn Hex and Other Selection Games
inferred← citeshttps://doi.org/10.1080/08993400500222066openalex-snapshot
The machine intelligence Hex project
inferred← citeshttps://doi.org/10.1080/15427951.2008.10129176openalex-snapshot
Atropos: A PSPACE-Complete Sperner Triangle Game
inferred← citeshttps://doi.org/10.1090/mbk/101openalex-snapshot
Game Theory, Alive
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.001.0001openalex-snapshot
The Nature of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0004openalex-snapshot
Dedication
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0006openalex-snapshot
Figure Credits
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0007openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0001openalex-snapshot
Prologue
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0002openalex-snapshot
The Basics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0003openalex-snapshot
Insights and Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0004openalex-snapshot
Needles in a Haystack: the Class NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0005openalex-snapshot
Who is the Hardest One of All? NP-Completeness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0006openalex-snapshot
The Deep Question: P vs. NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0007openalex-snapshot
The Grand Unified Theory of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0008openalex-snapshot
Memory, Paths, and Games
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0009openalex-snapshot
Optimization and Approximation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0010openalex-snapshot
Randomized Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0011openalex-snapshot
Interaction and Pseudorandomness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0012openalex-snapshot
Random Walks and Rapid Mixing
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0013openalex-snapshot
Counting, Sampling, and Statistical Physics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0014openalex-snapshot
When Formulas Freeze: Phase Transitions in Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0015openalex-snapshot
Quantum Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.005.0001openalex-snapshot
Mathematical Tools
inferred← citeshttps://doi.org/10.1109/aerocs.1993.720966openalex-snapshot
Robust Stability and Game of Hex
inferred← citeshttps://doi.org/10.1109/ccc.2008.35openalex-snapshot
Constraint Logic: A Uniform Framework for Modeling Computation as Games
inferred← citeshttps://doi.org/10.1109/cec.2003.1299946openalex-snapshot
Towards staged evolution of an artificial player for hex by enlarging the boardsize during training
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00119openalex-snapshot
Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography
inferred← citeshttps://doi.org/10.1109/fskd.2007.185openalex-snapshot
Apply Heuristic Search to Discover a New Winning Solution in Hex Game
inferred← citeshttps://doi.org/10.1109/ictai52525.2021.00078openalex-snapshot
Adversarial Multi-Agent Path Finding is Intractable
inferred← citeshttps://doi.org/10.1109/itw.2010.5593334openalex-snapshot
On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms
inferred← citeshttps://doi.org/10.1109/tciaig.2014.2345398openalex-snapshot
Stronger Virtual Connections in Hex
inferred← citeshttps://doi.org/10.1109/tg.2017.2785042openalex-snapshot
Move Prediction Using Deep Convolutional Neural Networks in Hex
inferred← citeshttps://doi.org/10.1109/tg.2020.3033720openalex-snapshot
The Complexities of Random-Turn Hex, Square, and Triangle Games
inferred← citeshttps://doi.org/10.1142/9789814335843_0009openalex-snapshot
MISCELLANEOUS PROBLEMS
inferred← citeshttps://doi.org/10.1201/b10581-21openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.14232/phd.1010openalex-snapshot
The Chooser-Picker games
inferred← citeshttps://doi.org/10.2307/2273858openalex-snapshot
Classifying the computational complexity of problems
inferred← citeshttps://doi.org/10.3233/icg-180055openalex-snapshot
A transferable neural network for Hex
inferred← citeshttps://doi.org/10.3390/software4040023openalex-snapshot
Parallel Towers of Hanoi via Generalized Nets: Simulated with OnlineGN
inferred← citeshttps://doi.org/10.4230/lipics.fun.2022.11openalex-snapshot
Quantum Combinatorial Games: Structures and Computational Complexity
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2021.25openalex-snapshot
Dots & Boxes Is PSPACE-Complete
inferred← citeshttps://doi.org/10.48550/arxiv.0812.3677openalex-snapshot
Artificial intelligence for Bidding Hex
inferred← citeshttps://doi.org/10.48550/arxiv.1807.04724openalex-snapshot
Computational Complexity of Games and Puzzles
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.