★ 3 (fi 6)(EITHER, 3-0-3)
This course provides an introduction to search and planning in artificial intelligence. The course covers deterministic single-agent and multi-agent problems. Students will learn how to model real-world problems as state-space search problems and how to solve such problems. The course covers algorithms for solving deterministic shortest path problems with factored and non-factored states, combinatorial optimization problems, constraint satisfaction problems, and multi- agent problems. Prerequisites: CMPUT 204 or 275, and CMPUT 272.
LECTURE B1 (41213)
2023-01-05 - 2023-04-12
MWF 11:00 - 11:50 (ETLC E1-007)
★ 3 (fi 6)(EITHER, 3-0-0)
LECTURE B2 (49499)
2023-01-05 - 2023-04-12
MW 15:30 - 16:50 (CSC B-43)