A Knights Puzzle

Hi Fellas, I was solving problems on Reddit and I saw this one. It was quite interesting so I decided to share this with you.

            Stan and Troy were playing chess, After a few games, Stan removed all the pieces on the board and placed a Knight on the chessboard (The position of the Knight is arbitrary). Stan said to troy "Let's play a game. There is only a Knight on the board, You can move the Knight anywhere on the board, After your move, I will play my move. the square the Knight will visit will close and the Knight cannot visit the square again. The game will end when any one of us is left with no moves to move the knight."

            Troy agreed and the game started. No matter which move Troy played, Stan always wins the game. The puzzle is that can you tell the winning strategy of troy? This puzzle is quite interesting and I want you to solve it. It's not that hard to solve but you have to think about all the possible moves which can be played by Troy (Tip: The reason Stan is winning because he is playing first) I will tell its answer after some days. Good luck solving this puzzle.