AI

Task: In this task you are asked to solve a modified version of the 8-puzzle problem using different search algorithms we studied in this course. The problem consists of the following numbers: 1,1,2,3,3,4,5,6 and an empty slot. A sample of the initial state and the goal state are shown in the below figure. You are allowed to use any programming language to complete this task. You are asked to do the following tasks to receive full credits: 1. Write a code that generates a random initial state. 2. Write a code that solves the problem using breadth-first search (BFS). Your solution should show the number of generated nodes, the number of expanded nodes, the level at which the solution was found, and the path to solution. 3. Write a code that solves the problem using iterative deepening search (IDS). Your solution should show the number of generated nodes, the number of expanded nodes, the level at which the solution was found, and the path to the solution. 4. Define two different heuristics for this problem (h1 and h2), then write a code that solves the problem using A with h1 and h2. Your solution should show the number of generated nodes, the number of expanded nodes, the level at which the solution was found, and the path to the solution. Your output should be shown in the command line, example: ** If the number of steps exceeds 10 , then print the number of steps but the state of the problem at each step. Initial state: 1,3,6,4,5,3,2,1,0 (representing empty slot) Step 1: 1, 3, 6, 4, 5, 3, 2, 0,1 Step 2: .... Number of expanded nodes: \#\# Number of visited nodes: \#\# Solution found at level: \#\# Grading: - Generating the random initial state is worth 2 points. - Implementation of the BFS is worth 2 points. Showing the correct results is worth 1 point each. - Implementing IDS is worth 2 points. Showing the correct results is worth 1 point each. - Defining the heuristics is worth 1 point each. Implementing the A is worth 2 points. Showing the results is worth 1 point each. - Submissions after the deadline by (0-24 hours) will result in reducing your grade by 20% - Submissions after the deadline by (24-48 hours) will result in reducing your grade by 40% - Submissions after the deadline by (48-72 hours) will result in reducing your grade by 50% - Submissions after 72 hours will not be accepted Task: In this task you are asked to solve a modified version of the 8-puzzle problem using different search algorithms we studied in this course. The problem consists of the following numbers: 1,1,2,3,3,4,5,6 and an empty slot. A sample of the initial state and the goal state are shown in the below figure. You are allowed to use any programming language to complete this task. You are asked to do the following tasks to receive full credits: 1. Write a code that generates a random initial state. 2. Write a code that solves the problem using breadth-first search (BFS). Your solution should show the number of generated nodes, the number of expanded nodes, the level at which the solution was found, and the path to solution. 3. Write a code that solves the problem using iterative deepening search (IDS). Your solution should show the number of generated nodes, the number of expanded nodes, the level at which the solution was found, and the path to the solution. 4. Define two different heuristics for this problem (h1 and h2), then write a code that solves the problem using A with h1 and h2. Your solution should show the number of generated nodes, the number of expanded nodes, the level at which the solution was found, and the path to the solution. Your output should be shown in the command line, example: ** If the number of steps exceeds 10 , then print the number of steps but the state of the problem at each step. Initial state: 1,3,6,4,5,3,2,1,0 (representing empty slot) Step 1: 1, 3, 6, 4, 5, 3, 2, 0,1 Step 2: .... Number of expanded nodes: \#\# Number of visited nodes: \#\# Solution found at level: \#\# Grading: - Generating the random initial state is worth 2 points. - Implementation of the BFS is worth 2 points. Showing the correct results is worth 1 point each. - Implementing IDS is worth 2 points. Showing the correct results is worth 1 point each. - Defining the heuristics is worth 1 point each. Implementing the A is worth 2 points. Showing the results is worth 1 point each. - Submissions after the deadline by (0-24 hours) will result in reducing your grade by 20% - Submissions after the deadline by (24-48 hours) will result in reducing your grade by 40% - Submissions after the deadline by (48-72 hours) will result in reducing your grade by 50% - Submissions after 72 hours will not be accepted