An algorithm is the description of an automated solution to a problem. What the algorithm does is precisely defined. The solution could or could not be the best possible one but you know from the start what kind of result you will get. You implement the algorithm using some programming language to get (a part of) a program. Now, … Read more
You comment says you are looking for shortest path. This problem is a variation of TSP on a planar graph, and thus is NP-Hard. Possible heuristics function for A* that can solve the problem but is not admissible [thus the path found is not guaranteed to be optimal]: Sum of manhattan distances from all fruits to the agent. You can also use an … Read more
As Russel and Norvig point out in Artificial Intelligence: A Modern Approach (the most commonly used AI textbook) it is challenging to come up with a heuristic that is admissible but not consistent. Obviously, you can select values for nodes in a graph such that the heuristic they represent is admissible but not consistent. This … Read more