On the complexity of connection games (Q307770): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4655205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchical approach to computer Hex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Which Is Complete in Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hex ist Pspace-vollständig. (Hex is Pspace-complete) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dead Cell Analysis in Hex and the Shannon Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all solutions and instances of Numberlink and Slitherlink by ZDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Monte–Carlo Tree Search in Havannah / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Othello game on an \(n\times n\) board is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: GO Is Polynomial-Space Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hex and combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Chess / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized pursuit-evasion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT Suspects and Tough Customers: Open Problems of Downey and Fellows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong computational lower bounds via parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding first-order properties of locally tree-decomposable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fairness and complexity of generalized \(k\)-in-a-row games / rank
 
Normal rank

Latest revision as of 13:22, 12 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of connection games
scientific article

    Statements

    On the complexity of connection games (English)
    0 references
    0 references
    0 references
    0 references
    5 September 2016
    0 references
    complexity
    0 references
    Havannah
    0 references
    Twixt
    0 references
    Hex
    0 references
    Slither
    0 references
    PSPACE
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references