***By Matlab

Assignment 1 - Search Algorithms Introduction: In this assignment, your objective is to implement the search algorithms and solve a given problem. Choose one from the following two problems. Implement the breadth-first search, depth-first search, and A* search algorithms. Problems: Problem 1: Tower of Hanoi Assume you have 3 poles and 32 discs of decreasing diameter. A disc may be stacked only on top of a larger disc or onto an empty pole. Initially all discs are stacked correctly on one of the poles. The objective is to correctly stack all of the discs on a different pole. Instruction: 1. Determine a suitable state-space representation for the selected problem. 2. How are the initial state and the goal state represented? 3. Define a set of actions and conditions necessary to apply each action) that can be applied to search the state space and solve the problem. 4. Define the action cost and total cost. 5. For A* search, define the heuristic function and cost. 6. Implement the search algorithms using Matlab or C/C++ and clearly display your result for Steps 1 to 5 described above. 7. Submit your report. The marking scheme is attached. Assignment 1 - Search Algorithms Introduction: In this assignment, your objective is to implement the search algorithms and solve a given problem. Choose one from the following two problems. Implement the breadth-first search, depth-first search, and A* search algorithms. Problems: Problem 1: Tower of Hanoi Assume you have 3 poles and 32 discs of decreasing diameter. A disc may be stacked only on top of a larger disc or onto an empty pole. Initially all discs are stacked correctly on one of the poles. The objective is to correctly stack all of the discs on a different pole. Instruction: 1. Determine a suitable state-space representation for the selected problem. 2. How are the initial state and the goal state represented? 3. Define a set of actions and conditions necessary to apply each action) that can be applied to search the state space and solve the problem. 4. Define the action cost and total cost. 5. For A* search, define the heuristic function and cost. 6. Implement the search algorithms using Matlab or C/C++ and clearly display your result for Steps 1 to 5 described above. 7. Submit your report. The marking scheme is attached