On the fairness and complexity of generalized \(k\)-in-a-row games

DOI10.1016/j.tcs.2007.05.031zbMath1149.68038OpenAlexW1969892711WikidataQ56225517 ScholiaQ56225517MaRDI QIDQ2456362

Shi-Chun Tsai, Ming-Yu Hsieh

Publication date: 18 October 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.05.031

zbMATH Keywords

computational complexity\(k\)-in-a-row gamesmathematical games

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Related Items (3)

On the complexity of connection games ⋮ Drawn \(k\)-in-a-row games ⋮ The biased, distance-restricted \(n\)-in-a-row game for small \(p\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gobang is PSPACE-complete
• The Othello game on an \(n\times n\) board is PSPACE-complete
• Drawing planar graphs using the canonical ordering
• N by N Checkers is Exptime Complete
• GO Is Polynomial-Space Hard
• Minesweeper is NP-complete.
• Games solved: Now and in the future
• The accelerated \(k\)-in-a-row game

This page was built for publication: On the fairness and complexity of generalized \(k\)-in-a-row games