Imagine a chessboard like this:
You are the white knight and can move as a knight does in chess.
Your goal is to visit every square on the board using legal chess knight moves while never touching a square you have already visited. However, someone is trying to stop you in your quest! They are the black knight:
Every time you make a move, the black knight makes a move, also (and follows the same rules that you do). You cannot move to where the black knight is, nor can you touch any of the squares the black knight has visited.
Your question is this: What is the minimum number of turns required for the black knight to ensure that you have no legal move to make? Show the game in your answer.
The person who has the smallest number of moves (tiebreaker is time) by July 1st’s answer will be accepted and (possibly) a bounty will be awarded depending on the popularity of this question.
Note: this is not an open-ended question... There is a smallest number of moves!