On a generalization of Kaplansky's game

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In this paper, games of the following general kind are studied: Two players move alternately by selecting unselected integer coordinate points in the plane. On each move, the first player selects exactly r points and the second player selects exactly one point. The first player wins if he can select p points on a line having none of his opponent's points before his opponent selects q points on a line having none of his own. If this latter eventuality occurs first, the second player wins. It is shown that if p ≥ c(r)q, then the second player can always win.

Original languageEnglish (US)
Pages (from-to)27-35
Number of pages9
JournalDiscrete Mathematics
Volume42
Issue number1
DOIs
StatePublished - Jan 1 1982
Externally publishedYes

Fingerprint

Game
Line
Generalization
Integer

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

@article{dd00155da32a4e5186d7efd4db50f888,
title = "On a generalization of Kaplansky's game",
abstract = "In this paper, games of the following general kind are studied: Two players move alternately by selecting unselected integer coordinate points in the plane. On each move, the first player selects exactly r points and the second player selects exactly one point. The first player wins if he can select p points on a line having none of his opponent's points before his opponent selects q points on a line having none of his own. If this latter eventuality occurs first, the second player wins. It is shown that if p ≥ c(r)q, then the second player can always win.",
author = "Jozsef Beck",
year = "1982",
month = "1",
day = "1",
doi = "https://doi.org/10.1016/0012-365X(82)90050-4",
language = "English (US)",
volume = "42",
pages = "27--35",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1",

}

On a generalization of Kaplansky's game. / Beck, Jozsef.

In: Discrete Mathematics, Vol. 42, No. 1, 01.01.1982, p. 27-35.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On a generalization of Kaplansky's game

AU - Beck, Jozsef

PY - 1982/1/1

Y1 - 1982/1/1

N2 - In this paper, games of the following general kind are studied: Two players move alternately by selecting unselected integer coordinate points in the plane. On each move, the first player selects exactly r points and the second player selects exactly one point. The first player wins if he can select p points on a line having none of his opponent's points before his opponent selects q points on a line having none of his own. If this latter eventuality occurs first, the second player wins. It is shown that if p ≥ c(r)q, then the second player can always win.

AB - In this paper, games of the following general kind are studied: Two players move alternately by selecting unselected integer coordinate points in the plane. On each move, the first player selects exactly r points and the second player selects exactly one point. The first player wins if he can select p points on a line having none of his opponent's points before his opponent selects q points on a line having none of his own. If this latter eventuality occurs first, the second player wins. It is shown that if p ≥ c(r)q, then the second player can always win.

UR - http://www.scopus.com/inward/record.url?scp=49049137772&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49049137772&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/0012-365X(82)90050-4

DO - https://doi.org/10.1016/0012-365X(82)90050-4

M3 - Article

VL - 42

SP - 27

EP - 35

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1

ER -