3 ms·
Mutilated chessboard problem
- glxc 11y ago"here's another interview brain teaser for sociopathic managers"
- wolfgke 11y agoRather a simple exercise for a first-semester exercise sheet.
- danbruc 11y agoOnly if you already know the trick to attack this class of problems.
- semi-extrinsic 11y agoReally? Just by looking at the figure, bruteforcing for a couple of minutes and then noticing a solution which gives the same problem but 6x6 instead of 8x8, I was able to solve this without even pen and paper. Unless you're talking about an extremely abstract class of problems, I don't think that statement is true.
- wolfgke 11y agoNo, it's really that easy: Clearly the complete coverings with dominoes biject to matchings of the graph with vertices = squares and edges defined by 2-sets of squares sharing an edge on the chessboard. Clearly this graph is bipartite, but the two elements of the bipartision are of different cardinality. Thus no perfect matching can exist.
- ap22213 11y agoWe solved this as a high school homework problem.
- eli173 11y agoI was shown a similar problem (I believe it was originally a Putnam question) which asked if you could cover a chessboard missing one corner with L-shaped triominos, and then asked to prove whether or not you could always cover a 2nx2n board with one corner missing. Neat problem
- wolfgke 11y agoIndeed (spoiler!) an easy, but nice induction proof, which easily can be turned into an algorithm.
- Grustaf 11y agoThe problem where one square of each is colour is removed is much more interesting. It's not obvious to me why it should always be possible to solve that problem, regardless of which squares are removed, but apparently it is. I wonder if it can be proved without resorting to looking at classes of cases (removed squares right next to each other, removed squares with two squares between them, etc)?
- ColinWright 11y agoYes - there is a simple, clear, elegant way to see that removing one square of each colour leaves the board coverable. It's even given in the article.
- probably_wrong 11y agoI got the correct answer immediately because I've seen a similar problem before in HN, although with a Tetris lamp instead. Link: http://jackm.co.uk/the-simple-proof-of-the-tetris-lamp/ http://jackm.co.uk/the-simple-proof-of-the-tetris-lamp/ Discussion: https://news.ycombinator.com/item?id=8870479 https://news.ycombinator.com/item?id=8870479