On the fairness and complexity of generalized \(k\)-in-a-row games (Q2456362): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Drawing planar graphs using the canonical ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minesweeper is NP-complete. / rank
 
Normal rank
Property / cites work
 
Property / cites work: GO Is Polynomial-Space Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The accelerated \(k\)-in-a-row game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gobang is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>N</i> by <i>N</i> Checkers is Exptime Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games solved: Now and in the future / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550233 / rank
 
Normal rank

Latest revision as of 11:13, 27 June 2024

scientific article
Language Label Description Also known as
English
On the fairness and complexity of generalized \(k\)-in-a-row games
scientific article

    Statements

    On the fairness and complexity of generalized \(k\)-in-a-row games (English)
    0 references
    0 references
    0 references
    18 October 2007
    0 references
    \(k\)-in-a-row games
    0 references
    computational complexity
    0 references
    mathematical games
    0 references

    Identifiers