That's a nice way of saying "when using brute force, always pick the most promising move" (known as the Minimax Algorithm), which implies that your algorithm knows a correct solution before making the first move.
Actually, to accomplish this task, there is a nice heuristic that states that player can start from
any square and should move the horse to the next legal but not-yet-visited square according
to the following rule: consider all the legal but not-yet-visited squares and pick the one that
would have the maximum number of legal moves next.