Talk:Mutilated chessboard problem

{{GA|20:34, 17 September 2022 (UTC)|page=1|subtopic=Mathematics and mathematicians|oldid=1110831567}}

{{old XfD multi |date=23 April 2007 |page=Wikipedia:Articles for deletion/Dominoes_on_a_chessboard_puzzle |result=keep}}

{{DYK talk|21 October|2022|image=Mutilated chessboard vectorized.svg|entry=... that if you remove two opposite corners of a chessboard, you cannot cover all squares with dominos?|nompage=Template:Did you know nominations/Mutilated chessboard problem}}

{{WikiProject banner shell|class=GA|

}}

Solution "without proof"?

Why the solution is said to be "without proof"?--Pokipsy76 (talk) 08:56, 5 January 2008 (UTC)

Merge disscussion

Gomory's theorem is nearly the same thing. Should this be merged? If not, at least links between these articles would be appropriate. --ἀνυπόδητος (talk) 10:01, 26 October 2009 (UTC)

:They are not quite the same thing (this article is about nonexistence of solutions on a chessboard with some two particular squares removed, Gomory's theorem is about existence for some other removals) but they are so close that I agree it makes sense to merge them. I have gone ahead and performed the merge. —David Eppstein (talk) 15:28, 26 October 2009 (UTC)

Additional removals

The way the article state's Gomory's theorem, it sounds like it allows multiple removals. Gomory's theorem doesn't hold if you do more than one removal. For example, you could isolate a single, white, corner square by removing 2 blacks and 2 whites.--131.122.40.229 (talk) 04:45, 9 August 2010 (UTC)

History

The problem was not introduced by Gamow & Stern (1958), as it was discussed earlier, in 1954, by Solomon W. Golomb in his paper "Checker Boards and Polyominoes" in The American Mathematical Monthly, Vol. 61, No. 10/1954, where the author calls it 'the well-known problem' which suggests the puzzle was introduced even earlier. Tavilis (talk) 19:25, 15 January 2013 (UTC)

Did you know nomination

{{Template:Did you know nominations/Mutilated chessboard problem}}