Hacker News new | ask | show | jobs
by hughdbrown 1243 days ago
Shortest path solution using breadth-first search

https://gist.github.com/hughdbrown/5c14ec41c30532807afaeba9c...

Same result as the solver below:

https://github.com/rubenvannieuwpoort/funnyhowtheknightmoves...

except for this path:

a3 c2 e3 g4 h2

a3 c2 e3 f1 h2