Off topic, but tangentially related:

I was trying to use a modified Dijkstra / A* algorithm for this year’s Advent of Code Day 17 problem:

https://adventofcode.com/2023/day/17

I never got the right answer though because there was some issue with the way I was tracking visited nodes. I was trying to use north, south, west, east rather than row and column direction values like other solutions I read, but I’m stubborn and it seems to me I should be able to get it work storing cell (as a (row, column) tuple)), direction, and distance travelled (1-3).

If you did this day, how did you do it?