(The below text version of the notes is for search purposes and convenience. See the PDF version for proper formatting such as bold, italics, etc., and graphics where applicable. Copyright: 2022 Retraice, Inc.)

Re85: The Details (Best-First-Search Part 4, AIMA4e pp. 73-74)

retraice.com

Looking ahead at the code we'll need. An attempt to build a toy problem reveals unsatisfied dependencies; the need for a problem implementation with state space, actions sets, transition model and action cost function; AIMA's RouteProblem class and best_first_search function implementations as guides; walking through the suites of each; the need for PriorityQueue and f to order our search tree's frontier of nodes.

Air date: Saturday, 17th Dec. 2022, 10:00 PM Eastern/US.

expand(problem, node) dependencies ________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________

PIC We need to implement a problem, with a state space, initial and goal states, actions sets, transition model and action cost function. ________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________

The RouteProblem example ________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________

PIC The AIMA implementation of RouteProblem, a subclass of Problem. ________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________

Looking ahead at Best-First-Search implemented ________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________

PIC We're also going to need a PriorityQueue, and f, an implemented evaluation function that will prioritize our nodes for next expansion. ________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________

Other sources consulted during this livestream: * Russell & Norvig (2020); * Retraice (2022/12/14); * Retraice (2022/12/15); * Retraice (2022/12/16); * http://aima.cs.berkeley.edu/figures.pdf; * https://github.com/aimacode/aima-python/blob/master/search4e.ipynb; * https://github.com/retraice/ReAIMA4e/tree/main/Re85-BEST-FIRST-Part-4.

__

References

Retraice (2022/12/14). Re82: What is a problem? (BEST-FIRST-SEARCH Part 1, AIMA4e pp. 73-74). retraice.com. https://www.retraice.com/segments/re82 Retrieved 15th Dec. 2022.

Retraice (2022/12/15). Re83: A Problem Instantiated (BEST-FIRST-SEARCH Part 2, AIMA4e pp. 73-74). retraice.com. https://www.retraice.com/segments/re83 Retrieved 16th Dec. 2022.

Retraice (2022/12/16). Re84: A Node Instantiated (BEST-FIRST-SEARCH Part 3, AIMA4e pp. 73-74). retraice.com. https://www.retraice.com/segments/re84 Retrieved 17th Dec. 2022.

Russell, S., & Norvig, P. (2020). Artificial Intelligence: A Modern Approach. Pearson, 4th ed. ISBN: 978-0134610993. Searches: https://www.amazon.com/s?k=978-0134610993 https://www.google.com/search?q=isbn+978-0134610993 https://lccn.loc.gov/2019047498