Work on covering a rectangle with T-tetrominos, using the least amount of monominos.

The open conjecture is that every rectangle with both dimensions bigger than some size can be covered with at most 5 monominos.

• bibliography/ Previous papers.
• legacy/ Old stuff, some of which doesn't work any more or is redundant.
• search/ Code to search for coverings.
• results/ Python code to generate a best known covering for every rectangle.
• rh/ Results and code from Prof. Robert Hochberg, as well as some helper code to work with his files.
• writing/ Writing to present this research and related code and data.