Skip to main content

All Questions

Tagged with
Filter by
Sorted by
Tagged with
4 votes
1 answer
1k views

Is there an efficient algorithm for solving tiling puzzles?

As an example of the type of problem, consider Stewart Coffin's Cruiser puzzle: Let R be a 48 × 31 rectangle. Let T be a 30°-60°-90° triangle with hypotenuse 34.565 (so legs are 17.2825 and 29.934)...
WHY's user avatar
  • 363
7 votes
2 answers
549 views

Fill up a tetris field where bordering tiles have different colors

Is it possible to completely fill the infinite tetris field $\mathbb Z^2$ with tetrominoes such that no tetromino borders another one of the same type? Assume that two tetromiones border each other ...
GOTO 0's user avatar
  • 13.6k