This commit is contained in:
Miloslav Ciz 2024-10-03 22:09:52 +02:00
parent 766d037053
commit 494a57eaf9
8 changed files with 1880 additions and 1846 deletions

View file

@ -27,7 +27,7 @@ The fact that **nonograms don't generally have a unique solution** is easy to se
*[SAF](saf.md) fish encoded as nonogram.*
While construction clues from given picture is trivial, solving nonogram is **[NP complete](np_complete.md)**, i.e. "(probably) difficult and slow", for which very different imperfect approaches are being utilized and combined, such as [DFS](dfs.md), [genetic algorithms](genetic.md) or [neural networks](neural_net.md). Some tips for solving (manual or automated) are these:
While constructing clues from given picture is trivial, solving nonogram is **[NP complete](np_complete.md)**, i.e. "(probably) difficult and slow", for which very different imperfect approaches are being utilized and combined, such as [DFS](dfs.md), [genetic algorithms](genetic.md) or [neural networks](neural_net.md). Some tips for solving (manual or automated) are these:
- Reasoning techniques can in many situations be applied to quickly find which squares will be colored, for example:
- A single clue number in row/column that's bigger than half of the grid size means that some of the center squares have to be colored because there is an overlap of both extremes. This can be generalized to "an intersection of all possible configurations can be safely colored", i.e. consider all possibilities for a row/column and color the squares that are colored in all of them (and vice versa, if some square is NOT colored in all configurations, it can be marked as surely white).