August 12, 2012
Project for the Graph theory course.
A T-Tetromino is the T shaped block, most known as a block in the tetris game. In literature is know that a surface must be multiple of 4 x 4 to be fully tiled with this block, but there is not a known formula to count all the possible different tilings.
I found a recursive formula by examining all the possible cases and associating them to a graph representation. We could not find a formal proof of correctness, but we can adfirm it is a good lower bound for the problem.
Tiling bidimensionale con T-Tetromini (Italian)