@nishaanth can u give the outline?// On 1/21/11, nishaanth <[email protected]> wrote: > Its a state space search. Solve it by using any of the known search > algorithms. > > BFS, Best first search, DFS, A* > > On Fri, Jan 21, 2011 at 2:00 PM, snehal jain <[email protected]> wrote: > >> You have a dictionary of N words each of 3 chars. Given 2 words you >> have to find the optimum path between the 2 words. The optimum path >> contains the words in the dictionary each word at a distance of 1 from >> the previous word. >> for eg source = cat , target = sun >> path is >> cat -> bat -> but -> bun -> sun >> given all these words are in the dictionary >> >> -- >> 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. >> >> > > > -- > S.Nishaanth, > Computer Science and engineering, > IIT Madras. > > -- > 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. > >
-- Rahul K Rai [email protected] -- 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.
