whts complexity for this movegen() On Fri, Jan 21, 2011 at 9:52 PM, nishaanth <nishaant...@gmail.com> wrote:
> Ok lets define the following functions. > > movegen()- gives the list of next move given the state. This is basically > all the 1 distance words given the current word. > > heuristic()- this gives the number of non-matching characters of the given > word with the goal word. > > Start from start state and expand. > Now always choose the move which gives a lesser heuristic valued state. > Stop if you reach the goal. > > You can refer to Russel Norvig book on AI for detailed explanation. > > > > Regards, > > 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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
