Applied Science > EXAM > CSE 440: Artificial Intelligence Midterm Assignment, Summer 2021 North South University Full Marks: (All)

CSE 440: Artificial Intelligence Midterm Assignment, Summer 2021 North South University Full Marks: 50

Document Content and Description Below

Problem 1. Intelligent Agents and Search [10 Points] Suppose that you need to find a path between S and G in the following graph. The number attached to each edge in the graph represents the actual ... cost of traversing the edge. Assume also that the heuristic distances to the goal from each node are given by the following table: Node S A C D F G H Heuristic dist. To G 10 5 4 3 4 0 2 For each of the following search methods, list the nodes in the order in which they are expanded by the search method while looking for a solution. Show your work. When everything else is equal, order the nodes in alphabetical order. (10 points) i. Depth First Search ii. Breadth First Search iii. Uniform Cost Search iv. Greedy Best First Search v. A* search Problem 2. Adversarial Search [15 points] a) Suppose that you are playing a game of tic-tac-toe on a 3X3 board with your friend. You are the MAX player, and you are playing with "X". The current board configuration is depicted below and it is your turn to move. Assume also that the utility function is given by: ??????? ?? ? ???????? ????? ????????????? = { −+011,,, ?? ?? ???? ′′???? ′′ ???? ???? ? ???? Use the minimax procedure to select your next move. First, you must expand the game tree, which is rooted at the current board configuration below, until the terminal states are reached. Then use minimax algorithm to select your optimal next move. (5 points) [Show More]

Last updated: 2 years ago

Preview 1 out of 3 pages

Buy Now

Instant download

We Accept: