1

Here the Solution to the problem from myself The problem can be modeled in a graphical way as followed: A person has to reach from one node of a graph to another, and the current distance from the goal is not known. Problem statement: Find a path between two nodes of a graph where the edge weights or any other kind of heuristic is unknown. Operator: ...


Only top voted, non community-wiki answers of a minimum length are eligible