You are viewing a single comment's thread. Return to all comments →
it looks like a classical https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
but on a second thought it is easier to do a https://en.wikipedia.org/wiki/Breadth-first_search
and of course you don't need to construct the full graph, you can navigate it on the fly
Seems like cookies are disabled on this browser, please enable them to open this website
Snakes and Ladders: The Quickest Way Up
You are viewing a single comment's thread. Return to all comments →
it looks like a classical https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
but on a second thought it is easier to do a https://en.wikipedia.org/wiki/Breadth-first_search
and of course you don't need to construct the full graph, you can navigate it on the fly