Introduction - If you have any usage issues, please Google them yourself
Use BFS algorithm and queue on the board to achieve a known " horse" in the initial position, get the function which can be reached within a specified number of steps in all positions