On a combinatorial game

P. Erdös, J. L. Selfridge

Research output: Contribution to journalArticle

165 Citations (Scopus)


A drawing strategy is explained which applies to a wide class of combinatorial and positional games. In some settings the strategy is best possible. When applied to n-dimensional Tic-Tac-Toe, it improves a result of Hales and Jewett [5].

Original languageEnglish
Pages (from-to)298-301
Number of pages4
JournalJournal of Combinatorial Theory, Series A
Issue number3
Publication statusPublished - May 1973

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'On a combinatorial game'. Together they form a unique fingerprint.

  • Cite this