feat: add new debug cases to day 16

Author: Flashky

src/main/java/com/adventofcode/flashk/day16/ReindeerMaze.java

@@ -180,6 +180,9 @@ public long solveB(){
         }
         // Pasada 2, buscamos caminos alternativos en cada una de las intersecciones.
 
+        startTile.setPath(true);
+        endTile.setPath(true);
+
         paint();
         return countPathTiles();
     }
@@ -226,27 +229,16 @@ private void reset() {
         }
     }
 
-    private void fillPath() {
-        Tile end = map[endPos.getY()][endPos.getX()];
-        Tile start = map[startPos.getY()][startPos.getX()];
-        Tile current = end;
-        while(current != start) {
-            current = current.getParent();
-            current.setPath(true);
-        }
-    }
-
     private void fillPath(Tile start, Tile end) {
-        //Tile start = map[startPos.getY()][startPos.getX()];
-        //Tile end = map[endPos.getY()][endPos.getX()];
 
         Tile current = end;
         while(current != start) {
             current = current.getParent();
             current.setPath(true);
         }
 
-        end.setPath(true);
+        start.setPath(true);
+
     }
 
     private Set<Tile> getAdjacents(Tile parent) {

src/test/java/com/adventofcode/flashk/common/test/constants/TestDisplayName.java

@@ -43,6 +43,7 @@ private TestDisplayName() {}
 	public static final String PART_2_SAMPLE_5 = "Part 2 - Sample 5";
 	public static final String PART_2_SAMPLE_6 = "Part 2 - Sample 6";
 	public static final String PART_2_DEBUG = "Part 2 - Debug";
+	public static final String PART_2_DEBUG_2 = "Part 2 - Debug 2";
 
 	public static final String PART_ONE_SINGLE_SAMPLE = "Part 1 - Single sample data";
 }

src/test/java/com/adventofcode/flashk/day16/Day16Test.java

@@ -190,9 +190,45 @@ public void testSolvePart2Input() {
 		System.out.println("Solution: "+reindeerMaze.solveB());
 
 		// 512 -> too low
+		// 513 -> That's not the right answer; your answer is too low.
+		// Curiously, it's the right answer for someone else;
+		// you might be logged in to the wrong account or just unlucky.
+		// 514 -> too low
 
 		assertEquals(0L,0L);
 
 	}
 
+	// Alternate test cases:
+	// https://www.reddit.com/r/adventofcode/comments/1hfhgl1/2024_day_16_part_1_alternate_test_case/
+
+	@Test
+	@Order(6)
+	@Tag(TestTag.PART_2)
+	@Tag(TestTag.INPUT)
+	@DisplayName(TestDisplayName.PART_2_DEBUG)
+	public void testSolvePart2Debug() {
+
+		// Read input file
+		char[][] inputs = Input.read2DCharArray(INPUT_FOLDER, "debug_edge_1.input");
+		ReindeerMaze reindeerMaze = new ReindeerMaze(inputs);
+
+		assertEquals(149L,reindeerMaze.solveB());
+
+	}
+
+	@Test
+	@Order(6)
+	@Tag(TestTag.PART_2)
+	@Tag(TestTag.INPUT)
+	@DisplayName(TestDisplayName.PART_2_DEBUG_2)
+	public void testSolvePart2Debug2() {
+
+		// Read input file
+		char[][] inputs = Input.read2DCharArray(INPUT_FOLDER, "debug_edge_2.input");
+		ReindeerMaze reindeerMaze = new ReindeerMaze(inputs);
+
+		assertEquals(264L,reindeerMaze.solveB());
+
+	}
 }