diff --git a/README.md b/README.md
index f5113f2..3d2ceca 100644
--- a/README.md
+++ b/README.md
@@ -44,6 +44,12 @@ For this puzzle I added a class for [points in two-dimensional space](AdventOfCo
 
 My implementation uses an ordering matrix (a two-dimensional boolean array) to track which page combinations are ordered, and then queries that matrix for each ordered combination of pages in a single line. The same matrix can then also be used for a custom sort function for part 2.
 
+### Day 10: Hoof It
+
+:mag_right: Puzzle: <https://adventofcode.com/2024/day/10>, :white_check_mark: Solver: [`HoofIt.cpp`](AdventOfCode2024/HoofIt.cpp)
+
+The algorithm starts at the trail ends (the `9`'s) and searches all options from there downwards until trailheads are reached. For each visited map location, it tracks unique reachable end points (for part 1) and number of possible paths to end points (for part 2). These values are accumulated, if during the search the same map location is encountered again. 
+
 ## Thanks
 
 * [Alexander Brouwer](https://github.com/Bromvlieg) for getting the project set up with CMake.