You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
According to Batenburg and Kosters (2009), the algorithm allows for more than two colors (black and white). I want to modify the implementation to allow for multicolored nonograms.
But looking at the code, it seems like this is NOT easy to implement. Correct me if I'm wrong, but the entirety of the implementation assumes only two possible colors, black and white, and thus adding a new color would require a complete refactoring of the entire code base first.
How long do you think it would take to refactor the code to allow for more than two colors? (Ignoring the extra code to load a new file format and the png generation. Those are easy.)
Thanks!
The text was updated successfully, but these errors were encountered:
According to Batenburg and Kosters (2009), the algorithm allows for more than two colors (black and white). I want to modify the implementation to allow for multicolored nonograms.
But looking at the code, it seems like this is NOT easy to implement. Correct me if I'm wrong, but the entirety of the implementation assumes only two possible colors, black and white, and thus adding a new color would require a complete refactoring of the entire code base first.
How long do you think it would take to refactor the code to allow for more than two colors? (Ignoring the extra code to load a new file format and the png generation. Those are easy.)
Thanks!
The text was updated successfully, but these errors were encountered: