In case of DP also, you will require to move in a BFS manner only, a neatly written BFS will definitely make it fast.
On Wed, Aug 25, 2010 at 7:34 PM, krazee koder <[email protected]>wrote: > 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Regards Saikat Kumar Debnath IIIrd year, Computer Science Deptt., Delhi Technological University, (formerly Delhi College of Engineering) Delhi -- 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.
