https://www.hackerrank.com/challenges/red-knights-shortest-path/problem
Step 1:
- iterate over all possibilities to get shortest path.
Step 2:
- optimise by: when one path is found, all next iterations should not continue.
Step 3
- since there are no obstacles it can be optimised by filtering only movements that get you closer to subject.