pavel-arkharov/fillit

Project for Hive Helsinki, part of 42 school

fillit

Project is part of 42 curriculum made during my studies in Hive Helsinki school in partnership with @kyyninen.

Project aims at basic algorithmics. Searching for best possible solution among many options.

Input

Program takes a file as parameter, which contains a list of Tetriminos, or 4x4 text block-pieces consisting of four (tetro) filled-squares.

Validity of input has to be checked, rules for valid tetriminos are following:

• Input consists only of empty character '.', filled character '#' and newlines
• Tetriminos presented each on the block of 4 lines, each of which contains exactly 4 character and a newline
• There is a newline between tetriminos blocks
• Correct input consists of 1-26 tetriminos
• There are exactly four '#' in one tetrimino block
• Each '#' connected to at least one another '#' from top, down, left or right, but not diagonally

Here's some examples of non-valid input:

Aim

Goal of the program to find the smallest possible square that will fit all the tetriminoes from the input file. In order to that we are not allowed to rotate, flip or modify the tetriminoes in any way. Resulting square has to be printed out with capital letters starting with 'A' assigned to each tetrimino.

Example:

Out of all possible solutions the program must select the one that places tetriminos to the most upper-left position.

According to this rule, the correct answer is a).

Compilation

Downlaod the repo and run the make command from the root folder. Sample input files can be found is /sample folder.