Mighty Knight(regular chess moves only) is trapped in corner cell H1.
What are the minimum number of moves needed for the Knight to visit each X marked cells?
Example: F2..1. D1...2. Etc
Final individual Values need to be given for only for X marked cells only.