As you compare each pair identify the MAX value in the pair. If you look at the tests, they assert that the value equals a total SUMed value - not a path. My inital attempts were focused on tracking the path (slide down), instead focus on the maximum sum.

can you please elaborate maxiumum sum of what we should compare?

Try again but focus on the maximum sum part of the description, not the path.

Any resources to share on graph theory and how that helped you find the solution? Its been a decade since I took Discrete.

Nevermind. Here's a hint, instead of focusing on the path as I did above, focus on the maximum sum part of the definition of "slide down" from the description.

Will someone please post the path for the first huge pyramid so I can compare? My solution works for the small and medium pyramids. Currently I get the fail message of "should work for huge pyramids - Expected: 7273, instead got: 6542" and my path is:

[59, 73, 52, 53, 87, 57, 92, 81, 81, 79, 31, 93, 78, 17, 75, 77, 69, 60, 22, 81, 70, 58, 39, 45, 62, 57, 31, 24, 90, 17, 89, 69, 73, 52, 39, 90, 84, 52, 95, 65, 94, 64, 96, 22, 58, 45, 56, 82, 74, 52, 98, 38, 91, 78, 90, 70, 61, 17, 65, 87, 90, 23, 54, 89, 97, 41, 32, 99, 76, 84, 65, 85, 27, 80, 75, 46, 96, 76, 77, 56, 86, 69, 90, 84, 76, 27, 78, 19, 45, 88, 48, 83, 76, 6, 87, 53, 99, 64, 77, 63]

I didn't realize one could chain to the end of enum block like that. This helped me to refactor my solution, thanks!