3.2 Minimax The first zero-sum-game algorithm we will consider is minimax, which runs under the motivating assumption that the opponent we face behaves optimally, and will always perform …

Hence, the space complexity of DFS is \ (O (bm)\). 1.3.2 Breadth-First Search Description - Breadth-first search is a strategy for exploration that always selects the shallowest frontier …

For a propositional logical system, if there are \ (N\) symbols, there are \ (2^N\) models to check, and hence the time complexity of this algorithm is \ (O (2^N)\), while in first-order logic, the …

2.2 Solving Constraint Satisfaction Problems Constraint satisfaction problems are traditionally solved using a search algorithm known as backtracking search. Backtracking search is an …

An algorithm, forward chaining, iterates through every implication statement in which the premise (left-hand side) is known to be true, adding the conclusion (right-hand side) to the list of known …

In a general CSP with n variables, each taking d possible values, what is the worst case time complexity of enforcing arc consistency using the AC-3 method discussed in class?

Arc consistency is typically implemented with the AC-3 algorithm (Arc Consistency Algorithm #3), for which the pseudocode is as follows: The AC-3 algorithm has a worst-case time complexity …

Suppose that we were running local search with the min-conflicts algorithm for this CSP, and currently have the following variable assignments.

9.2 Naive Bayes We’ll motivate our discussion of machine learning with a concrete example of a machine learning algorithm. Let’s consider the common problem of building an email spam …

Introduction to Artificial Intelligence Note 3 These lecture notes are heavily based on notes originally written by Nikhil Sharma.