title: Knight's tour algorithm with adjacency-lists
body: <p>I'm trying to solve the Knight's tour problem in Java.
  My goal is to calculate all possible tours of a horse on a chessboard with any dimension. What I have tried to use is an adjadency-lists data structure. The problem now, is that I know which squares are adjacent to a square, but I don't know what direction the adjacent square is in. How would I fix this?</p>