added a very hard puzzle (which currently has more solutions than it …

…should have because the rule about each row and column should be unique is not yet implemented)

src/test/java/net/zomis/minesweeper/analyze/bounded/Binero.java

@@ -100,6 +100,16 @@ public void hard() throws Exception {
 		}
 	}
 
+	@Test
+	public void veryHard() throws Exception {
+		AnalyzeFactory<Integer> puzzle = binero(getClass().getResourceAsStream("veryhard"));
+		AnalyzeResult<Integer> solved = puzzle.solve();
+		System.out.println(solved.getTotal());
+		for (Solution<Integer> ee : solved.getSolutions()) {
+			System.out.println(ee);
+		}
+	}
+
 	private static Integer pos(int x, int y, int size) {
 		return y * size + x;
 	}

src/test/resources/net/zomis/minesweeper/analyze/bounded/veryhard

@@ -0,0 +1,6 @@
+xx1xxx
+00x1xx
+0xxxxx
+xxxxxx
+xxx1xx
+xxxx0x