This demo has an accompanying blog post. The code is on github.
In chess, a knight moves in an L-shape. How many moves does it take for the knight to get from a given square to another?