From 9a96b67857034d42687cc90f38fe46112889c779 Mon Sep 17 00:00:00 2001
From: "dependabot[bot]" <49699333+dependabot[bot]@users.noreply.github.com>
Date: Tue, 17 Dec 2024 12:59:43 +0000
Subject: [PATCH 1/3] build(deps-dev): bump
 org.junit.jupiter:junit-jupiter-engine

Bumps [org.junit.jupiter:junit-jupiter-engine](https://github.com/junit-team/junit5) from 5.11.3 to 5.11.4.
- [Release notes](https://github.com/junit-team/junit5/releases)
- [Commits](https://github.com/junit-team/junit5/compare/r5.11.3...r5.11.4)

---
updated-dependencies:
- dependency-name: org.junit.jupiter:junit-jupiter-engine
  dependency-type: direct:development
  update-type: version-update:semver-patch
...

Signed-off-by: dependabot[bot] <support@github.com>
---
 pom.xml | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/pom.xml b/pom.xml
index 9a0e61e..1140998 100644
--- a/pom.xml
+++ b/pom.xml
@@ -11,7 +11,7 @@
 		<project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
 		<lombok.version>1.18.36</lombok.version>
 		<!-- Testing -->
-		<junit.jupiter.version>5.11.3</junit.jupiter.version>
+		<junit.jupiter.version>5.11.4</junit.jupiter.version>
 		<!-- Plugins -->
 		<maven-surefire-plugin.version>3.5.2</maven-surefire-plugin.version>
 		<maven-compiler-plugin.version>3.13.0</maven-compiler-plugin.version>

From dbae4a6e9111ea0b5a13dca3a5ff9ded20a15184 Mon Sep 17 00:00:00 2001
From: Flashky <mevengar@gmail.com>
Date: Wed, 18 Dec 2024 15:50:41 +0100
Subject: [PATCH 2/3] test: add explanation for last debug case for day 16

---
 .../adventofcode/flashk/day16/Day16Test.java  | 20 +++++++++++++++++++
 1 file changed, 20 insertions(+)

diff --git a/src/test/java/com/adventofcode/flashk/day16/Day16Test.java b/src/test/java/com/adventofcode/flashk/day16/Day16Test.java
index a59cd0e..9691766 100644
--- a/src/test/java/com/adventofcode/flashk/day16/Day16Test.java
+++ b/src/test/java/com/adventofcode/flashk/day16/Day16Test.java
@@ -226,6 +226,26 @@ public void testSolvePart2Debug2() {
 
 		// Read input file
 		char[][] inputs = Input.read2DCharArray(INPUT_FOLDER, "debug_edge_2.input");
+
+		// Situación esperada
+		// ########################################################
+		// #.........#.........#.........#.........#.........#...O#
+		// #OOOOOOOOO#OOOOOOOOO#OOOOOOOOO#OOOOOOOOO#OOOOOOOOO#...O#
+		// #OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#...O#
+		// #OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#...O#
+		// #OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#...O#
+		// #OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#OOOO#...O#
+		// #OOOO#OOOOOOOOO#OOOOOOOOO#OOOOOOOOO#OOOOOOOOO#OOOOOOOOO#
+		// #OOOO#.........#.........#.........#.........#.........#
+		// ########################################################
+		//
+		//  28 círculos caja izquierda
+		// 216 círculos caja centrales
+		//  10 círculos verticales
+		//	10 círculos en la última caja
+		//
+		// Total = 264
+
 		ReindeerMaze reindeerMaze = new ReindeerMaze(inputs);
 
 		assertEquals(264L,reindeerMaze.solveB());

From cf3d333e8ece1706aa85e1bee68ba2e27c7b7c5a Mon Sep 17 00:00:00 2001
From: Flashky <mevengar@gmail.com>
Date: Wed, 18 Dec 2024 16:22:36 +0100
Subject: [PATCH 3/3] test: add more test info at day 16

---
 .../adventofcode/flashk/day16/Day16Test.java  | 21 ++++++++++++++++++-
 1 file changed, 20 insertions(+), 1 deletion(-)

diff --git a/src/test/java/com/adventofcode/flashk/day16/Day16Test.java b/src/test/java/com/adventofcode/flashk/day16/Day16Test.java
index 9691766..2ecd0a4 100644
--- a/src/test/java/com/adventofcode/flashk/day16/Day16Test.java
+++ b/src/test/java/com/adventofcode/flashk/day16/Day16Test.java
@@ -227,7 +227,25 @@ public void testSolvePart2Debug2() {
 		// Read input file
 		char[][] inputs = Input.read2DCharArray(INPUT_FOLDER, "debug_edge_2.input");
 
-		// Situación esperada
+		// Source: https://www.reddit.com/r/adventofcode/comments/1hfhgl1/2024_day_16_part_1_alternate_test_case/
+
+		// ########################################################
+		// #.........#.........#.........#.........#.........#...O#
+		// #...OOOOOO#...OOOOOO#...OOOOOO#...OOOOOO#...OOOOOO#...O#
+		// #...O#...O#...O#...O#...O#...O#...O#...O#...O#...O#...O#
+		// #...O#...O#...O#...O#...O#...O#...O#...O#...O#...O#...O#
+		// #...O#...O#...O#...O#...O#...O#...O#...O#...O#...O#...O#
+		// #...O#...O#...O#...O#...O#...O#...O#...O#...O#...O#...O#
+		// #...O#...OOOOOO#...OOOOOO#...OOOOOO#...OOOOOO#...OOOOOO#
+		// #OOOO#.........#.........#.........#.........#.........#
+		// ########################################################
+		//
+		// Camino inicial:
+		// 21 giros
+		// 110 pasos
+		// Coste total = 21100
+
+		// Tras ejecutar el algoritmo de la parte 2 debería quedarse así:
 		// ########################################################
 		// #.........#.........#.........#.........#.........#...O#
 		// #OOOOOOOOO#OOOOOOOOO#OOOOOOOOO#OOOOOOOOO#OOOOOOOOO#...O#
@@ -245,6 +263,7 @@ public void testSolvePart2Debug2() {
 		//	10 círculos en la última caja
 		//
 		// Total = 264
+		// Cualquiera de los caminos óptimos tendría un coste de: 21110
 
 		ReindeerMaze reindeerMaze = new ReindeerMaze(inputs);