Anonymous user
Talk:Nonogram solver: Difference between revisions
→Ye Olde Black Cat In A Coal Cellar: suggest additional requirement
mNo edit summary |
(→Ye Olde Black Cat In A Coal Cellar: suggest additional requirement) |
||
| (3 intermediate revisions by 2 users not shown) | |||
Line 3:
--LambertDW 03:41, 9 November 2017 (UTC)
:It should not depend on the Linux flavour. I use g++, I would expect anything after 4.9 and probably some before to work. It does require --std=c++11. I guess you've done that as my compiler suggests it when a c++11 feature is required when I haven't asked for it. If that doesn't fix it then perhaps you could include the pertinent error messages. --[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 11:01, 9 November 2017 (UTC)
===Python Entry===
Line 18 ⟶ 20:
</pre>
is a unique 5x5 nonogram, which I am calling "Black Cat In A Coal Cellar". This may score highly for novelty, but only low for interest or difficulty. It is probably beyond the ability of an RC task to imbue a computer with artistic temperament. It may even be beyond my ability.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 11:33, 28 May 2016 (UTC)
: The original author of the phrase "unique nonogram" probably intended to describe a set of constraints that has exactly one solution, as opposed to ones that have multiple solutions. Simply counting out the constraints for a pattern drawn by hand can easily create constraints that are satisfied by multiple solutions; the trivial example of this is the two checkerboard patterns on any board that has both dimensions even. A reasonable demand, that excludes trivial uniques such as the empty pattern, is that the percentage of marked cells be within a certain range. --[[User:Adlai|Adlai]] ([[User talk:Adlai|talk]]) 06:29, 3 March 2021 (UTC)
| |||