in reply to Find solution to knight's tour
AM, this is a common problem in computer science literature, and would be an appropriate level for a introductory CS course at the end of a semester. Please show some work you have done to indicate that you have shown some effort, and are not just looking to have someone else do your homework for you.
If this is not the case, my apologies in advance. Timing and wording are very "student"ish.
You may want to look at topics for recursion, spanning tree, game theory, travelling salesman problem, or NP-Complete for ideas on solving this problem.
Update 1: remove introductory
Update 2: Add places to look for solutions
--MidLifeXis
|
|---|