User:RDBury/Polyomino tiling

A polyomino tiling problem is the problem in recreational mathematics of finding a way to tile a given rectangle or other region in the plane with congruent copies of a given polyomino. Alternatively, a set of polyominoes is given and the problem is to find a way to tile a given with the set using each tile exactly once. There are many generalizations and variations on the problem, for example using polyforms other than polyominoes. Of particular interest are methods to prove a tiling does not exist without having to check a large number of possible partial tilings.