diff --git a/obj/io.o b/obj/io.o
deleted file mode 100644
index c6099b4..0000000
Binary files a/obj/io.o and /dev/null differ
diff --git a/obj/main.o b/obj/main.o
deleted file mode 100644
index f163bdd..0000000
Binary files a/obj/main.o and /dev/null differ
diff --git a/obj/map_helpers.o b/obj/map_helpers.o
deleted file mode 100644
index e589152..0000000
Binary files a/obj/map_helpers.o and /dev/null differ
diff --git a/obj/parsing.o b/obj/parsing.o
deleted file mode 100644
index f6887af..0000000
Binary files a/obj/parsing.o and /dev/null differ
diff --git a/obj/parsing_simple.o b/obj/parsing_simple.o
deleted file mode 100644
index 50ebe01..0000000
Binary files a/obj/parsing_simple.o and /dev/null differ
diff --git a/obj/printing.o b/obj/printing.o
deleted file mode 100644
index 1af1a17..0000000
Binary files a/obj/printing.o and /dev/null differ
diff --git a/obj/solution.o b/obj/solution.o
deleted file mode 100644
index e62045c..0000000
Binary files a/obj/solution.o and /dev/null differ
diff --git a/srcs/solution.c b/srcs/solution.c
index 89d112b..c8d5167 100644
--- a/srcs/solution.c
+++ b/srcs/solution.c
@@ -6,12 +6,17 @@
 /*   By: tischmid <marvin@42.fr>                    +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2023/04/04 21:46:57 by tischmid          #+#    #+#             */
-/*   Updated: 2023/04/05 10:03:19 by tischmid         ###   ########.fr       */
+/*   Updated: 2023/04/05 10:31:15 by tischmid         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
 #include "solution.h"
 
+// Replace each cell by the number of obstacles a rectangle starting
+// from the top left cell, filling the board until the cell in question,
+// covers. Border is inclusive. This will enable us to check if a given
+// square contains obstacles or not in O(1) time, instead of O(n^2),
+// namely by summing up the corner cells alternatingly (+, -, +, -, clockwise).
 void	preprocess_map(t_map *map)
 {
 	int		is_obstacle;
@@ -29,7 +34,6 @@ void	preprocess_map(t_map *map)
 	}
 }
 
-	// if (idx - 1 - map->meta.width < 0
 int	count_obstacles(t_map *map, int idx, int sq_size)
 {
 	int	alternat_corner_sum;