Credits Min: 3
Credits Max: 3
Topics include: search techniques and their properties, including A*; game-playing, including adversarial and stochastic search; probabilistic reasoning, including Markov Decision Processes and Hidden Markov Models; and reinforcement learning, including value iteration and q-learning. Topics are developed theoretically and with programming assignments. The course includes a student-directed final project and paper.
Co-req: COMP 3010 Organization of Programming Languages and MATH 3860 Probability and Statistics I.
View Current Offerings