Chess.....knight

[Unregistered]

hello,I am a chinese
my English is broken,so I can't express very well,sorry
this is a brainstorming....
*==>knight
this is a 5*5 chess board
|*| | | | | |1| | | | | |1| | | | |
| | | | | | | | | | | | | | | | | |
Start| | | | | |==> | |*| | | |==>| |2| | | |==>........
| | | | | | | | | | | | | | | |*| |
| | | | | | | | | | | | | | | | | |
you have 24 steps to walk through every blocks........
and print the result(1~25).......
Can you give me an answer, please?

[Unregistered]

post again
|*|_|_|_|_|
|_|_|_|_|_|
|_|_|_|_|_|
|_|_|_|_|_|
|_|_|_|_|_|
*********
|1|_|_|_|_|
|_|_|_|_|_|
|_|*|_|_|_|first step...
|_|_|_|_|_|
|_|_|_|_|_|
*********
|1|_|_|_|_|
|_|_|_|_|_|
|_|2|_|_|_|second...
|_|_|_|*|_|
|_|_|_|_|_|
*********
|1|_|_|_|_|
|_|_|_|_|_|
|_|2|_|_|*|third.....
|_|_|3|_|_|
|_|_|_|_|_|

[Unregistered]

|1|_|_|_|_|
|_|_|_|_|*|
|_|2|_|_|_|third.....
|_|_|_|3|_|
|_|_|_|_|_|

[Stoned_Coder]

A good place to start would be some sort of heuristic. A basic pattern can be seen if you take every square on the board and calculate how many squares a knight can legally get to from that square. When you come to move your knight aim for the square with the most possibilities. The A* pathfinding algorithm may prove some help to you....
This may prove interesting.