3 ms·

I am stuck. What is the next step here? (Aside from programming it in Prolog.) https://i.imgur.com/ezUHHBp.png https://i.imgur.com/ezUHHBp.png

• kevlened 9y ago
  Look at row 3 (0,1,0, , , , ,0,1,0)
• aqme28 9y ago
  That's exactly where i got stuck too
• savanaly 9y ago
  Look for columns and rows where you have four of the five of 0's or 1's. Knowing there can be only one more of that type in the remaining empty spots usually yields something unless it's down to two empty spots.
• Jtsummers 9y ago
  Last year my desk calendar had a bunch of these sorts of puzzles, so some things I learned: Any time you see "0..1" you have to have a 0 and 1 between them. This is useful since each row/column must have the same number of 0s and 1s (5 each in your puzzle). So counting from (1,1) as the top left, what does (6,3) have to be? You may not know the position of all the 0s and 1s in row 6, but you have most of them accounted for because of this specific relationship, and one free space. Figure it out and you get at least 5 positions resolved. Keeping in mind that the number of 0s and 1s have to be the same, find rows where the number of 0s or 1s is near the max but the other is far from it. Your row 3 is one such location. There has to be one more 0 and three more 1s. Since the 1s can't all be together, you get some constraints on the outside of that four space gap "010...010". If you put the 0 on the outside of the gap, the 1s must be all in a row which is invalid. Your column 2 offers a similar situation. 4x0s and 2x1s. (from the top) ".01001...0". Where can the one remaining 0 go, or where can't it go? Repeating this I can spot about 15-20 spaces that'll be filled in very quickly, and the rest probably falls into place after that.