Rate this product
Task 2: Heuristic Search Algorithms
Domain for this assignment is : Blocks World Domain Blocks World Domain Game starts with an initial state consisting of a fixed number of blocks arranged in 3 stacks and we can move only top blocks of the stacks and we have to achieve a goal state that is a particular arrangement of blocks by moving these blocks. Blocks World is a planning problem where we know goal state beforehand and path to Goal state is more important
For the above domain implement the following search algorithms:
- Best First Search :Try out a minimum of 3 different heuristic functions and compare the results with valid reasoning. Use a priority queue for the OPEN list to make it computationally efficient.
- Hill Climbing :With a slight modification of code, implement Hill Climbing for the domain.
Compare the performance of the two in terms of time and space.
Evaluation Criteria:

![[Solved] CS312 Lab 2-Heuristic Search Algorithms](https://assignmentchef.com/wp-content/uploads/2022/08/downloadzip.jpg)

![[Solved] CS312 Lab 5-Game Playing](https://assignmentchef.com/wp-content/uploads/2022/08/downloadzip-1200x1200.jpg)
Reviews
There are no reviews yet.