Can I read Search Algorithms in EECS I on EtoBox?

Search Algorithms in EECS I by elvagojp is a document available to read on EtoBox.

What is Search Algorithms in EECS I about?

This document discusses search algorithms. It begins by showing an example of breadth-first search and depth-first search to find the shortest path from A to I on a grid. It then explains how to organize the search agenda as a stack for depth-first search and as a queue for breadth-first search. The document goes on to introduce uniform cost search, which accounts for differing action costs by associating costs with actions and exploring paths in order of total path cost using a priority queue.

Author

elvagojp

Language

EN