News for hackers. Stuff that matters.
Re:Mutilated chessboard problem by wolfgke on Sunday October 04, 2015 @04:20PM (#10328665)
Rather a simple exercise for a first-semester exercise sheet.
Re:Mutilated chessboard problem by danbruc on Sunday October 04, 2015 @04:38PM (#10328725)
Only if you already know the trick to attack this class of problems.
Re:Mutilated chessboard problem by wolfgke on Sunday October 04, 2015 @05:09PM (#10328836)
No, 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.
Re:Mutilated chessboard problem by semi-extrinsic on Sunday October 04, 2015 @04:58PM (#10328794)
Really? 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.
Re:Mutilated chessboard problem by ap22213 on Monday October 05, 2015 @12:17AM (#10329943)
We solved this as a high school homework problem.