<off-topic> puzzle solver - chess knights

[blit_40912]

has anyone ever created a program that solves a set of n-x-n tiles using a knight such that its next move won't come across the traversed tiles??

i know there's something magical when you put them on a 3 x 3 layout, the knight would just rotate its position from tile to tile and it will never reach the center.

x x x
x x x
x x x

if all moves fail then abort the process??

tnx in advance

 

[Nestharus]

That's just a simple tree search

 

[blit_40912]

do you have a demo?
how does your program work?
do i need to place the knight on the tile i want then start the process?

i saw someone who placed stones on his traversed
path on a 4 x 8 board placing his knight on the low-right
corner(X):

o o o o o o o o
o o o o o o o o
o o o o o o o x
o o o o o o o o

 

[-Kobas-]

You can make this in WE and then using analogy recode that in any programming language.
Why I suggest WE, because you can play with units and other already blizzard made models
and interface much easier than doing same in C# or C++.

Easy way to test your algorithm. Ofc if you know v/jass or zinc...