The correct solution to Berlekamp's switching game

We look at Berlekamp's switching game of n × n grids for n ⩾ 10 . We show that the previous result for R 10 was incorrect, and that in fact R 10 = 35 . We also show that R 11 = 43 and R 12 = 54 , and give new lower bounds for R 13 through R 20 .

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 287; no. 1; pp. 145 - 150
Main Authors Carlson, Jordan, Stolarski, Daniel
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 28.10.2004
Elsevier
Subjects
Algebra
Algebraic combinatorics
Berlekamp
Coding theory
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Lightbulb
Mathematics
Number theory
Sciences and techniques of general use
Lightbulb
Coding theory
Berlekamp
Discrete mathematics
Lower bound
Combinatorics
Berlekamp switching
Online AccessGet full text

Cover

More Information
Summary:We look at Berlekamp's switching game of n × n grids for n ⩾ 10 . We show that the previous result for R 10 was incorrect, and that in fact R 10 = 35 . We also show that R 11 = 43 and R 12 = 54 , and give new lower bounds for R 13 through R 20 .
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2004.06.015