Should each Piece orientation be processed under a new recursion level?

[alexjcook]

Currently we only iterate through the possible piece orientations to find the first fit on the board (if any). If the piece fits (ie. it can be placed onto the board), we delve a level deeper into the recursion to explore the subsequent possibilities.

Do we need to treat each possible orientation (that fits) as an "alternate timeline" to be explored?

[alexjcook]

This is only relevant if the goal is to find every possible solution.

If that IS the goal, I'm not convinced that the change would result in an exhaustive list of solutions anyway. I think we'd need to run the recursive solve for every possible permutation of the piece list, rather than a single pass with a prioritised order.

This needs a bit more thought.