4 ms·
I don't think that tiling a plane is exactly a "simple" problem.
by jbrooksuk 11y ago
I don't think that tiling a plane is exactly a "simple" problem.
- est 11y agoI mean something simple enough to understand, and could be played by average programmer in a IPython Notebook. I didn't mean simple to solve, just lower barrier of entry.
- leni536 11y agoI like this one: http://www2.stetson.edu/~efriedma/squinsqu/ http://www2.stetson.edu/~efriedma/squinsqu/ Can be easily generalized to other shapes and more dimensions too.
- pavel_lishin 11y agoDoes the lack of n = 16 mean that there's no current proof?
- leni536 11y ago> For the n not pictured, the trivial packing (with no tilted squares) is the best known packing.
- Dylan16807 11y agoWhy not? It seems simple to me. Simple doesn't mean easy. Factoring a 2048 bit number is very simple and very hard.
- cma 11y agoBecause then anything that can be proven in a given axiom system is considered simple because it can be done by enumerating each possible sequence of transformations.