Note: This course is not available for the current semester.
Course No: 91.420; Last Offered: No Data;
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.
Contact the Advising Center at 978-934-2474 or Continuing_Education@uml.edu
Use the Back button in your browser to go back to search results.