Tetris-Optimizer is an algorithmic task that aims to fit tetris pieces into the smallest square possible.

• The program requires a single parameter, which is a file containing a list of Tetriminos to assemble. The file must adhere to a specific format, where each Tetrimino must fit precisely in a 4x4 grid, and they are separated by a newline.
• If there are more than one commandline parameters given, the program will ask for its usage and terminate gracefully. There are at least one Tetrimino, but the upper bound is not set explicitly. However, I advise limiting the number of Tetriminos to 26 or fewer for experimentation and playing purposes.

• One piece is precisely 4 lines of 4 characters, each followed by a new line.
• A Tetrimino is a classic piece of Tetris composed of 4 blocks.
• Each character must be either a '#' character or '.' character.
• Each block of a Tetrimino must touch at least one other block on any of his 4 sides(up, down, left and right). This process is illustrated well with visualizations in the Beth Lock's article below.
• There are 19 valid pieces. If the input piece does not match one of them. Terminate the process.

• The initial square dimension, denoted as dim, is calculated as dim = sqrt(n * 4), where n represents the number of Tetrimino pieces.

• The algorithm employed in this process follows a classical backtracking approach. For each calculated dimension, we recursively fit all combinations of Tetrimino pieces within the square board.

 go run main.go sample.txt

In cases directory, there are tons of cases.

To run test, first go to the algorithm.

 cd algorithm

then

 go test

The processing times of functions can be found in log.txt after each run. You can view the contents of log.txt using the following command in the terminal or just open with text editor:

 cat log.txt

Go version 1.20

Used only standard library

Tetrimino background

42 School student Beth Locke's article

42 School student Phat Truong's article

Sudoku solver' backtracking algorithm

@mrqwer