Github – The following n-Block Puzzle Solver calculates every possibility to solve the puzzle on a user-defined X*Y sized board. There are two available types of calculation. The faster version uses a random unique block combinations, whereas the slower model goes through all possible block combinations.
Online at: http://www.BlockPuzzleSolver.com/
Here is a screenshot from the result in Chrome browser on my PC, using 40 Blocks () on a 16 x 10 board. Using a random approach, the puzzle was solved in 0.5 seconds on Pentium I7, even though there is 1,048,576 block combinations in the given order only. It’s altogether 144,542,561,803,960,000 distinct block permutations (math explained here). The random approach appears to be the winner in most cases. However, it doesn’t guarantee the solution, whereas going though all combinations does (if there is one), but it takes exponentially longer to solve the puzzle.