Skip to content

Comment on My Favorite Math Problem

Comments

I like this closely related and slightly more subtle problem:

Which unique square (up to symmetry) must be left if you cover the 64 squares of a chess board with 21 3x1 trominoes?

Knowing that the solution is unique makes this trivial to solve in a couple minutes just by scribbling on a piece of paper (I just did). It does not seem more subtle than the original.

Proving that the solution is unique may be more subtle.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.