Talk:Nonogram solver: Difference between revisions
no edit summary
No edit summary |
|||
Line 6:
::: It really depends on what operations are the slowest in the program. Row/col runs could initially generate a lot of possible patterns, so reducing memory footprint can reduce cache/page misses, which may help, but it really depends. Also keep in mind that whatever you use to track allowed cell values must have 4 states: must be filled, must be empty, can be either, and can be neither, which means it must have at least 2 bits per cell, so 64 bit likely will only represent up to 32 cells.
::: If I were to write it in C, I'd probably first try to find some other way to manage allowable patterns instead of generating all of them at once, which could be cleaner for a lower level language. But that's just a hunch. --[[User:Ledrug|Ledrug]] ([[User talk:Ledrug|talk]]) 01:48, 7 April 2014 (UTC)
===Ye Olde Black Cat In A Coal Cellar===
The bonus program needs a little clarification.
<pre>
E E E E E
E E E E E
</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)
| |||