| QUESTIONS | CATEGORIES | BLOG | PROFILE | Login | Register |
ASK QUESTION
Computers → Computer programming
ANSWERS: 1
  • iwnit
    Both solutions are used: "More problematic than its time complexity is A*’s memory usage. In the worst case, it must also remember an exponential number of nodes. Several variants of A* have been developed to cope with this, including iterative deepening A* (IDA*), memory-bounded A* (MA*) and simplified memory bounded A* (SMA*) and recursive best-first search (RBFS)." Source and further information: http://en.wikipedia.org/wiki/A*_search_algorithm Information about Best-first search: http://en.wikipedia.org/wiki/Best-first_search Information about iterative deepening: http://en.wikipedia.org/wiki/Iterative_deepening_depth-first_search Information about recursive Best-first search: http://ai.fri.uni-lj.si/gregorl/Students/mui/Recursive%20Best-First%20Search.ppt
    No comments

RELATED QUESTIONS

ABOUT ANSWERBAG

Answerbag wants to provide a service to people looking for answers and a good conversation. Ask away and we will do our best to answer or find someone who can.We try to vet our answers to get you the most acurate answers.

Copyright 2023, Wired Ivy, LLC

Answerbag | Terms of Service | Privacy Policy