Skip to content

Latest commit

 

History

History
14 lines (11 loc) · 538 Bytes

README.md

File metadata and controls

14 lines (11 loc) · 538 Bytes

Fillit

The goal of this project is to arrange every Tetrimino with each others in order to make the smallest possible square.
A Tetrimino is a shape made of 4 squares, often found in the game Tetris.
Example:
Screenshot

The program must display the smallest possible square on the standard output.
Each Tetrimino in the square solution will have a capital letter assigned to them starting with 'A' and increasing for each new Tetrimino.

Example output:
Screenshot