title: Knight's Tour using a Neural Network
body: <p>I was looking at the knights tour problem and decided to have a go at implementing it in python using a neural network to find solutions.</p>
  
  <p>The general explanation of the method can be found on <a href="http://en.wikipedia.org/wiki/Knight%27s_tour#Neural_network_solutions" rel="nofollow noreferrer">Wikipedia</a></p>
  
  <p>While I think I have implemented it correctly (I can't see anything else that is wrong), it doesn't work, it updates a few links, removing the edges where the connecting vertex has a degree more than two, but it doesn't converge on the solution.</p>
  
  <p>I was wondering if anyone had any ideas on what I have implemented incorrectly (Sorry about the horrible code).</p>
  
  <p><strong>EDIT</strong><br>
  Working code can be found at GitHub <a href="https://github.com/Yacoby/KnightsTour" rel="nofollow noreferrer">https://github.com/Yacoby/KnightsTour</a></p>