Question: Describe the two heuristics that you have devised in plain natural language. Further, one heuristic must be admissible and the other must be non-admissible. A*

Describe the two heuristics that you have devised in plain natural language. Further, one heuristic must be admissible and the other must be non-admissible. A* search is implemented. However, the provided implementation uses h(n) = 0 as its heuristic, effectively making it equivalent to a simple Breadth-First-Search. Devise two different heuristics to try to improve the performance of A* search on the Simplified Tetris problem (NxN grid with different sizes of blocks).

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!