- Artificial Intelligence Q1 M Fall21 1 (95.44 KiB) Viewed 17 times
Artificial Intelligence, Q1, M Fall21
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Artificial Intelligence, Q1, M Fall21
Artificial Intelligence, Q1, M Fall21
QUESTION 1. Consider a sliding-tile puzzle with three tiles and a blank and are given a problem with the following initial and final states where a "x" represents a blank spot. Assume that you always try moving the blank first right, then left, then up and then down. Goal 2 88 88 32 3 a. How many possible states are there, either reachable or unreachable, from the given start state. b. Draw the complete search space reachable from the given start state as a graph, mak- ing sure that a given state occurs only once. c. If we treated the search space as a tree, what would the result of a breadth-first search be? Of a depth-first search? d. If we treat the search space as a graph, what would the result of a breadth-first search be? Of a depth-first search? e. Suppose we use a hill climbing search algorithm on this problem with an evaluation function which counts the number of tiles "out of place" with respect to the goal. Will this lead to a solution?
QUESTION 1. Consider a sliding-tile puzzle with three tiles and a blank and are given a problem with the following initial and final states where a "x" represents a blank spot. Assume that you always try moving the blank first right, then left, then up and then down. Goal 2 88 88 32 3 a. How many possible states are there, either reachable or unreachable, from the given start state. b. Draw the complete search space reachable from the given start state as a graph, mak- ing sure that a given state occurs only once. c. If we treated the search space as a tree, what would the result of a breadth-first search be? Of a depth-first search? d. If we treat the search space as a graph, what would the result of a breadth-first search be? Of a depth-first search? e. Suppose we use a hill climbing search algorithm on this problem with an evaluation function which counts the number of tiles "out of place" with respect to the goal. Will this lead to a solution?