Computer Science, asked by ayushmukherjee9177, 10 months ago

Define heuristic function. Give an example heuristic function for 8-puzzle problem. Find the heuristics value for a particular state of the blocks world problem

Answers

Answered by prathanaprincess28
0

Answer:

Heuristic Function is a function that estimates the cost of getting from one place to another (from the current state to the goal state.) Also called as simply a heuristic.

Used in a decision process to try to make the best choice of a list of possibilities (to choose the move more likely to lead to the goal state.) Best move is the one with the least cost.

It can also be defined thus as a function that ranks alternatives in search algorithms at each branching step based on available information to decide which branch to follow.

Example for Blocks World Problem:

Consider below mentioned Start & Goal states for Blocks World

enter image description here

Heuristics function:

h(s) = Number of places with incorrect block

Answered by Rameshjangid
0

Answer: The amount of tiles that are out of place is an effective heuristic for the 8-puzzle. The sum of the distances between each tile and its desired position is a superior heuristic ("Manhattan distance"). The presence of straight contiguous tile reversals is an even more effective heuristic.

Explanation:

Step :1  A heuristic function is a function that estimates a problem's approximate cost (or ranks alternatives). Finding the shortest driving distance to a destination is an example of a problem. The distance in a straight line to the spot would be a heuristic cost.

A heuristic function, also known as a heuristic, is a function used in search algorithms to rank alternatives at each branching step depending on the information at hand to determine which branch to take. For instance, it might be close to the true answer.

Step :2 used to try to find the best option from a set of options in a decision-making process (to choose the move more likely to lead to the goal state.) The least expensive move is always the best.

Alternatively, it can be described as a function that ranks options in search algorithms at each branching stage based on the information at hand to determine which branch to take.

To learn more about similar questions visit:

https://brainly.in/question/1504255?referrer=searchResults

https://brainly.in/question/10396251?referrer=searchResults

#SPJ6

Similar questions