I have created the Block Puzzle Solver that calculates the solutions to monomino, domino, triomino, tetromino and pentomino(1) based rectangular or square tangram puzzle in a user-defined area, with support for block rotation and reflection. The fast version uses a random unique block combination. The slow version tests all possible block combinations and permutations (there can be quite a lot of them). The plan for the future is to include more pentominoes, heptominoes, octominoes & other polyominoes; as well as support user-defined areas of any shape.

### Source Code: Github

### Online Demo at **https://www.joe0.com/blockpuzzlesolver.com/**

### Screenshot:

This is the screenshot of the solution for exactly the same puzzle configuration in the picture above:

And here is a screenshot for using **38 **Blocks () on a **10 x 10** board. The puzzle was solved in 27.6s seconds on Pentium I7, even though there is block combinations in the given order only. It’s altogether distinct block permutations (math explained here). The chance of finding the solution is always dramatically improved by using monominoes or dominoes. The random approach appears to be the winner in most cases. However, it doesn’t guarantee the solution, whereas going through all combinations do (if there is one), but it takes exponentially longer to solve the puzzle.