i think v can solve it by DP technique..similar to LCS prob or assembly line scheduling(Cormen et. al.)
consider a two dimensional look up table. Each index refers to shortest distance taken by the knight to move that square. recursively try to call a fn. that changes source to the current square and stop till the current square reaches the destination. And then return the count... this is just my idea!! correct me if i am wrong... -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
