Tromino Puzzle

In my CS 317 - Algorithms class, we discussed an interesting divide and conquer algorithm for placing trominos to cover a floor with a size equal to 2^n tiles. I thought it would be fun to use JQuery and Javascript to implement this algorithm to test my skills.

The console asks you to put in a value that is found within the set (2^n) <=3 2. It will work for all values but will not show properly on the screen without further optimization. Afterwards, you are to click on a block and it will turn black. The remaining puzzle pieces will fall into place being calculated using a recursive function.