51–60 of 89 posts
I love this idea of collectively solving some set of puzzles. But I don’t understand how I can. The UI design seems broken. First I couldn’t interact with any puzzles until I realized these were already finished. But how do I get to unfinished ones? I scrolled forever and didn’t find one.
I love this idea of collectively solving some set of puzzles. But I don’t understand how I can. The UI design seems broken. First I couldn’t interact with any puzzles until I realized these were already finished. But how do I get to unfinished ones? I scrolled forever and didn’t find one.
There's a button at the top with an arrow ->, which lets you find an unsolved puzzle.
I saw that icon and interpreted it as an export button or something.
This is my game! I was recently curious about how many 5x5 nonograms can be solved purely with logic, no guessing. After running my nonogram solver on all 33,554,432 possible pixel combinations in a 5x5 grid, it turns out the answer is 24,976,511. Inspired by One Million Checkboxes, I thought it would be cool to create a realtime, collaborative nonogram game where we can collectively try to complete all ~25 million o…
questerzen (below) is correct: there are 25,309,575 solvable nonograms, not 24,976,511. This is OEIS sequence A242876 — https://oeis.org/A242876 okayestjoel (below) wrote: > My nonogram solver goes over every possible configuration for each row and column based on the clues, and either fills in squares that must be filled (all possibilities overlap) or marks squares that must be empty. So if the solver reaches a poin…
1 1 1
2 1 1 2 1
2 . . . . .
2 . . . . .
11 . . . . .
2 . . . . .
11 . . . . .
That means that no 5x5 requires guesswork.
Surely there’s got to be a maths video about this. It seems like an incredible little quirk…
This is my game! I was recently curious about how many 5x5 nonograms can be solved purely with logic, no guessing. After running my nonogram solver on all 33,554,432 possible pixel combinations in a 5x5 grid, it turns out the answer is 24,976,511. Inspired by One Million Checkboxes, I thought it would be cool to create a realtime, collaborative nonogram game where we can collectively try to complete all ~25 million o…
This is fun! But with more progress made, finding a puzzle to solve will become the hardest path. Maybe a heat map of all sections based on completion percentage? And maybe a way to jump to the first or a random unsolved puzzle once you've opened a section?
Earlier quoted context omitted.
Yes, 5x5 is small enough that all backtracking can be codified into easily human-accessible rules. * 5, 0, 1 1 1, 2 2, 3 1 and 3 1 are immediately solved * 4 lets you set 3 squares immediately * 3, 2 1 and 1 2 let you set 1 square immediately
In summary the only ones that don't let you put a square immediately are "0", "1", "2" and "1, 1". And as soon as you put a square you can put some crosses (right click). In the end it becomes fairly mechanic.
There must be a swastika picture in there, somewhere.
Earlier quoted context omitted.
questerzen (below) is correct: there are 25,309,575 solvable nonograms, not 24,976,511. This is OEIS sequence A242876 — https://oeis.org/A242876 okayestjoel (below) wrote: > My nonogram solver goes over every possible configuration for each row and column based on the clues, and either fills in squares that must be filled (all possibilities overlap) or marks squares that must be empty. So if the solver reaches a poin…
I don't know exactly how okayestjoel's solver works, but here's an example of a nonogram which I imagine it would consider "difficult": 1 1 1 2 1 1 2 1 2 . . . . . 2 . . . . . 11 . . . . . 2 . . . . . 11 . . . . . This puzzle has a unique solution (141a706), but none of the clues immediately tell you anything about the state of any specific cell.
[spoiler alert]
Naming the coumns ABCDE from left to right, and the rows 12345 from top to bottom. Let's consider B2 near the top left. If B2 full:
Then B1 is empty because B has "only" ones. Then the "two" block in row 1 must make D1 full. Then D2 is also full because D has a "two". Now B2 and D2 are full, but that's impossible because B has only a "two".
So the B2 must be empty. From that point it's possible to fill all the others without "guessing".
So no branches and 3 steps to get a contradiction. I can run that in my head, so I call it "thinking" instead of "backtracking".