# Mighty Knight Makes only Minimal Moves

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.

• Edited to clarify..to each X marked cell. – Uvc Jul 2 at 16:31

Here is a complete map of the minimum number of moves it takes for the knight to get from the top right corner to any square on the board:

This was found by manually doing a breadth-first search: marking all the 1-step spaces, then the 2-step spaces, then the 3-step spaces, and so on.

• But I mentioned ..no computers – Uvc Jul 2 at 16:49
• @Uvc Yes, I did it manually. The only automation involved was the coloring, to make the answer look nice. – Deusovi Jul 2 at 16:51
• Doing it all at once is much more efficient than doing every marked cell individually. – Deusovi Jul 2 at 16:51
• Probably..but If I asked for the whole map..people will complain, it is lot of work..this way, they can choose their own way – Uvc Jul 2 at 16:53
• @Uvc Yes, the question is a lot of work, which is why it's probably not a good question. I don't think there's anything interesting here. There aren't any "aha moments": it's either trial and error, or a bunch of boring work. – Deusovi Jul 2 at 16:56

Not sure if optimal but I've managed to do it in

$$19$$ moves

As follows

• I am sorry if I did not make it clear...to each cell – Uvc Jul 2 at 16:29
• @Uvc Hexomino has moved the knight to each x marked cell. – Ak19 Jul 2 at 16:36
• Hope I clarified in the edit..how many minimum moves to A1? How many min moves to A8 etc for all the X marked cells only...if you weretodo for all the cells, you will get min move Map for the Knight in H1. – Uvc Jul 2 at 16:41
• @Uvc So, this is just nine independent questions, effectively? – Deusovi Jul 2 at 16:42
• Yes.............min moves of course depend on the Knight position. – Uvc Jul 2 at 16:43