Unfortunately the interactive demo doesn't work for me (Firefox 143.0.4 on Windows):
> Uncaught TypeError: can't access property "inverse", this.puzzlemat.getScreenCTM() is null
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...Here's an assortment of links to places where you can buy interesting puzzles. This isn't exhaustive of course: it's just a few places that came to mind.
Tavern Puzzles, high quality metal entanglement puzzles:
https://tavernpuzzles.store.turbify.net/puzzle.html
Craighill. These puzzles are beautiful and double as art objects:
I could write a program myself to calculate the exact cover, but I guess, it will take me about a day to do so. It would not surprise me if the exact cover will be a few hundred mega bytes (when using one character per position).
Totally feeling like vibe-coding a web version of the game and plastering it with giant BUY THIS THING links that send people to the real thing.