Comment by MontyCarloHall

So many puzzles like this basically require you to brute-force the solution [0], which just isn’t all that fun. I’m glad the designers explicitly acknowledge they’re trying to avoid this, and really hope that their claim that this actually can be solved with logic holds true:

   What if instead of doing the full colored puzzle, we find partial sets of tiles where there is only one unique solution? This adds enough constraints to the problem that it becomes feasible [without resorting to brute force].

[0] https://www.puzzlemaster.ca/search/?c=woodpacking%2Cwoodtang...