# Tag Info

### What is a good heuristic function for A* to solve the "blocks world" game?

You may start assigning penalties for undesirable conditions in a state like: 1) Number of blocks outside stack 0. Supose you penalize with 10 units each block outside stack 0, then the starting ...

### How do we determine whether a heuristic function is better than another?

In the A* algorithm, at each iteration, a node is chosen which minimizes a certain function, called the evaluation function, which, in the case of A*, is defined as $$f(n)=g(n)+h(n)$$ where $g(n)$ ...

### If an heuristic is not admissible, can it be consistent?

If a heuristic is not admissible, can it be consistent? No. Consistency implies admissibility. In other words, if a heuristic is consistent, it is also admissible. However, admissibility does not ...

### If an heuristic is not admissible, can it be consistent?

For a heuristic to be admissible, it must never overestimate the distance from a state to the nearest goal state. For a heuristic to be consistent, the heuristic's value must be less than or equal to ...
Accepted

### Why is the effective branching factor used for measuring performance of a heuristic function?

I also walked into that trap the first few times. The difference is the following: $N$ is the number of expanded nodes $b^*$ is the effective branching factor $b^*$ depends on the depth $d$ of the ...
What is the difference between the heuristic function and the evaluation function in A*? The evaluation function, often denoted as $f$, is the function that you use to choose which node to expand ...