HN Explorer

3 comments

[ 4.6 ms ] story [ 72.2 ms ] thread
jaen
With the small graph in the post, finding the solution by searching backwards from "finished" graphs (ie. single-city) using dynamic programming should be simpler than beam search and guaranteed optimal.
salamo
See, that's why I have to post these things. Someone will inevitably reply with something more clever.
tajd
I love these sorts of applied maths sorts of post! Nice work, interesting reading.