Timeline for What's the best way to ensure a cryptogram has a unique solution?

10 events

when toggle format	what		by	license	comment
Dec 4, 2014 at 19:35	answer	added	Set Big O		timeline score: 7
Dec 4, 2014 at 19:22	history	edited	A E	CC BY-SA 3.0	neaten-up title
Dec 4, 2014 at 19:16	history	reopened	Bozman Warlord 099 A E warspyking Set Big O
Dec 4, 2014 at 19:01	review	Reopen votes
Dec 4, 2014 at 19:16
Dec 4, 2014 at 18:42	history	edited	warspyking	CC BY-SA 3.0	deleted 72 characters in body; edited title
Dec 4, 2014 at 3:44	comment	added	Ross Millikan		One way, which I suspect is the way the logic puzzle programmers do it, is to write a solving program with whatever logical implications you want. For a specific puzzle, you generate the solution first. You feed the (empty set) of clues to your solver. If it can't solve the puzzle, you add a random clue, then repeat until the solver succeeds. This lets you have different levels of puzzle, as you can limit the ways the solver can derive information.
Dec 4, 2014 at 2:07	history	closed	Doorknob		Needs more focus
Dec 4, 2014 at 2:07	history	reopened	user20
Dec 4, 2014 at 2:07	history	closed	user20		Needs more focus
Dec 4, 2014 at 2:02	history	asked	warspyking	CC BY-SA 3.0