0
$\begingroup$

I'm trying to write a program that finds an open knight's tour on 5X5 board starting from every point. I So the question is does every point actually has a solution. I found this answer that says that there is no solution when you start at any of the squares adjacent to a corner square. However when I run a program I get solutions only when I start in the points marked with k

 k| |k| |k
  |k| |k| 
 k| |k| |k
  |k| |k| 
 k| |k| |k
$\endgroup$
  • $\begingroup$ The very next answer says that tours only exist starting on a square the same color as a corner, agreeing with your diagram. $\endgroup$ – pjs36 Nov 16 '16 at 17:02
  • $\begingroup$ Thnx. I didn't quite get the coloring answer. $\endgroup$ – user2992672 Nov 16 '16 at 17:05

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.