On three-rowed Chomp

A.E. Brouwer; G. Horváth; I. Molnár-Sáska; C. Szabo

On three-rowed Chomp

A.E. Brouwer
, G. Horváth
, I. Molnár-Sáska
, C. Szabo

Discrete Algebra and Geometry

Research output: Contribution to journal › Article › Academic › peer-review

232 Downloads (Pure)

Abstract

Chomp is a 50 year-old game played on a partially ordered set P. It has been in the center of interest of several mathematicians since then. Even when P is simply a 3 × n lattice, we have almost no information about the winning strategy. In this paper we present a new approach and a cubic algorithm for computing the winning positions for this case. We also prove that from the initial positions there are infinitely many winning moves in the third row.

Original language	English
Pages (from-to)	1-11
Journal	Integers : Electronic Journal of Combinatorial Number Theory
Volume	5
Issue number	G07
Publication status	Published - 2005

Access to Document

624288Final published version, 153 KB

Cite this

@article{05fb55eea2aa404fa41f4de630028623,

title = "On three-rowed Chomp",

abstract = "Chomp is a 50 year-old game played on a partially ordered set P. It has been in the center of interest of several mathematicians since then. Even when P is simply a 3 × n lattice, we have almost no information about the winning strategy. In this paper we present a new approach and a cubic algorithm for computing the winning positions for this case. We also prove that from the initial positions there are infinitely many winning moves in the third row.",

author = "A.E. Brouwer and G. Horv{\'a}th and I. Moln{\'a}r-S{\'a}ska and C. Szabo",

year = "2005",

language = "English",

volume = "5",

pages = "1--11",

journal = "Integers : Electronic Journal of Combinatorial Number Theory",

issn = "1553-1732",

publisher = "Colgate University",

number = "G07",

}

TY - JOUR

T1 - On three-rowed Chomp

AU - Brouwer, A.E.

AU - Horváth, G.

AU - Molnár-Sáska, I.

AU - Szabo, C.

PY - 2005

Y1 - 2005

N2 - Chomp is a 50 year-old game played on a partially ordered set P. It has been in the center of interest of several mathematicians since then. Even when P is simply a 3 × n lattice, we have almost no information about the winning strategy. In this paper we present a new approach and a cubic algorithm for computing the winning positions for this case. We also prove that from the initial positions there are infinitely many winning moves in the third row.

AB - Chomp is a 50 year-old game played on a partially ordered set P. It has been in the center of interest of several mathematicians since then. Even when P is simply a 3 × n lattice, we have almost no information about the winning strategy. In this paper we present a new approach and a cubic algorithm for computing the winning positions for this case. We also prove that from the initial positions there are infinitely many winning moves in the third row.

M3 - Article

SN - 1553-1732

VL - 5

SP - 1

EP - 11

JO - Integers : Electronic Journal of Combinatorial Number Theory

JF - Integers : Electronic Journal of Combinatorial Number Theory

IS - G07

ER -

On three-rowed Chomp

Abstract

Access to Document

Fingerprint

Cite this