title: Tiling Algorithm
body: <p>I'm faced with a problem where I have to solve puzzles. </p>
  
  <p>E.g. I have an (variable) area of 20x20 (meters for example). There are a number of given set pieces having variable sizes. Such as 4x3, 4x2, 1x5 pieces etc. These pieces can also be turned to add more pain to my problem. The point of the puzzle is to fill the entire area of 20x20 with the given pieces. </p>
  
  <p>What would be a good starting algorithm to achieve such a feat?
  I'm thinking of using a heuristic that calculates the open space (for efficiency purposes). </p>
  
  <p>Thanks in advance</p>