This is a spacefilling-curve. Optimal solution is a Hilbert-Curve or a Morton-Curve. I have written one: http://sourceforge.net/projects/hilbert-curve/files.
On Aug 25, 4:27 am, Algo geek <[email protected]> wrote: > find the minimum no of moves by which a KNIGHT reaches the destination > from source in a 8x8 chess borad... > > **you will be given the starting position and ending position .. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
