TDWTF Plays Picross
-
@error_bot m n1 l1 l2 l6 l7 k4
-
-
Oops
@error_bot c n1 m n11
-
-
@error_bot f k2 k7 f6-h6 n6
-
-
@error_bot f g14 m j6 j13
-
-
@error_bot m h5 h7 n5
-
-
@error_bot f f5 l5 n3 n7 o3 o5 m c16 e16 l3 n1-2 n9-10 o1 o7
-
-
@error_bot f k9
(woof!
)
-
-
@error_bot f j10
-
-
@error_bot m k8 k11
-
-
@error_bot f k5
-
-
@error_bot m j5 m5
-
-
@error_bot f m1-2
-
-
@error_bot m m7
-
-
@error_bot f m14-15 mm6
-
-
@error_bot m m6 --force
-
-
@error_bot f o6 m o2
-
-
@error_bot m j2
-
-
@error_bot f j14
-
-
@error_bot m f14 h14 i14
-
@error_bot m f14 h14 i14
Patch.
-
-
Test.
@error_bot m o3
-
-
@coderpatsy said in TDWTF Plays Picross:
@error It could automagically mark based on what's filled, without looking at the solution. Like in this one, row m could have the first 1 crossed out, even if it's wrong (it's not, but).
@error This. Definitely no leaking the solution. May interact with/be a component for the solver. Basically, for any row/column explore all possible distributions of the clues over the values entered in the grid. If a clue always matches a string of black squares in the grid, cross it out. If there are no ways to match the clues for a line onto the values in the grid, highlight in red?
What to do if a clue always matches something in the grid, but not always in the same place?
-
@error_bot f f2 g2 f7 f10-12 f16
-
-
@error_bot m j1 f1 f3 c f16 m f15-f17 f i7-j7 m g7 e7 h10 i10
-
-
@error_bot f g5 m g4 g8-g10
-
-
@error_bot m i1 f i5 i6 f j3 j4 m j8 j15-j17 f j11
-