title: How to improve Knight's tour with Warnsdorff's rule?
body: <p>I know there are several similar threads, but I didn't find a solution even outside of SO. 
  Here's my problem:
  I implemented Warnsdorff's algorithm for the Knight's Tour problem <a href="http://en.wikipedia.org/wiki/Knight%27s_tour">http://en.wikipedia.org/wiki/Knight%27s_tour</a> , but it doesn't give a solution in some cases. On some places I read it can work much better with some alterations, but nobody specifies which alterations are those. Does somebody know the solution? I know of other algorithms, but they are much more complex.</p>
  
  <p>It sometimes doesn't give a good solution even for a 8x8 chessboard. I think no point in reading through my code, since it's a classical Warnsdorff's: check possible moves, and choose the one with the least possible moves in the next step.</p>