Discusses LISP, tree and graph searching algorithms: breadth first, depth first, and uniform cost. Also covers heuristic search methods, admissibility, and games: mini-max, alphaBeta. Students will learn theorem proving and question answering.
Credits:3
Pre-Req: 91.301 Org Programming Languages
Disclaimer One University Avenue . Lowell, MA 01854 . 978-934-4000 - Contact Us
This is an OfficialPage/Publication of the University of Massachusetts Lowell
