Three of the puzzles on my site are built the same way, and it took me longer than it should have to notice it was one idea.
Pipe Flow deals a board by walking one path that visits every square of the grid exactly once, then cutting that walk into one segment per colour. The segments cover the board and cannot overlap, so a solution exists before the player ever sees it.
Untangle joins the dots with no crossings FIRST, shortest pair before longest, and only then scrambles where the dots sit on screen. A crossing-free drawing exists by construction; nothing has to be searched to know it.
Picture Logic draws the picture, reads the run lengths off it, and hands those numbers to a line solver that may only fill a cell when every legal arrangement of that line agrees about it. If the solver cannot finish, the board is thrown away.
The shared rule is that none of them shuffles a board and hopes. They build the answer and derive the puzzle from it, which is the only way I found to promise a child that the thing in front of them is actually solvable. Shuffle first and you are left either checking solvability afterwards or apologising afterwards.
The cost is real and worth naming: the deal is slower, the generator is the hardest code in each game, and for Picture Logic a share of candidate boards get discarded. I will take all of that over a kid stuck on a board that never had an answer.
All three are here if you want to poke at them:
Source is MIT, so the generators are readable:
https://github.com/Sigmafier/ellaz-games
- Yatir