Martin Gardner’s Minimum No-3-in-a-Line Problem

From MaRDI portal
Publication:2928610

DOI10.4169/AMER.MATH.MONTHLY.121.03.213zbMATH Open1303.05020arXiv1206.5350OpenAlexW3098097583MaRDI QIDQ2928610FDOQ2928610


Authors: Alec S. Cooper, Oleg Pikhurko, John Schmitt, Gregory S. Warrington Edit this on Wikidata


Publication date: 10 November 2014

Published in: American Mathematical Monthly (Search for Journal in Brave)

Abstract: In Martin Gardner's October, 1976 Mathematical Games column in Scientific American, he posed the following problem: "What is the smallest number of [queens] you can put on a board of side n such that no [queen] can be added without creating three in a row, a column, or a diagonal?" We use the Combinatorial Nullstellensatz to prove that this number is at least n, except in the case when n is congruent to 3 modulo 4, in which case one less may suffice. A second, more elementary proof is also offered in the case that n is even.


Full work available at URL: https://arxiv.org/abs/1206.5350




Recommendations





Cited In (5)





This page was built for publication: Martin Gardner’s Minimum No-3-in-a-Line Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928610)