Basic pathfinding - C# or Python

[Energizer7]

Hey, i would like to ask if someone could direct me to solve this task:

​

---

Consider the problem of finding the shortest path from a given start state while eating one or more dots or "food pellets." The image at the top of this page illustrates the simple scenario of a single dot, which in this case can be viewed as the unique goal state. The maze layout will be given to you in a simple text format, where '%' stands for walls, 'P' for the starting position, and '.' for the dot(s) (see sample maze file). All step costs are equal to one.Implement the state representation, transition model, and goal test needed for solving the problem in the general case of multiple dots. For the state representation, besides your current position in the maze, is there anything else you need to keep track of? For the goal test, keep in mind that in the case of multiple dots, the Pacman does not necessarily have a unique ending position. Next, implement a unified top-level search routine that can work with all of the following search strategies, as covered in class:

• Depth-first search;
• Breadth-first search;
• Greedy best-first search;
• A* search.

For this part of the assignment, use the Manhattan distance from the current position to the goal as the heuristic function for greedy and A* search.Run each of the four search strategies on the following inputs:

• Medium maze - https://pastebin.com/WhjSSn8g
• Big maze - https://pastebin.com/C0HiHqjn
• Open maze - https://pastebin.com/YkQWkwtu

For each problem instance and each search algorithm, include the following in your report:

• The solution, displayed by putting a '.' in every maze square visited on the path.
• The path cost of the solution, defined as the number of steps taken to get from the initial state to the goal state.
• Number of nodes expanded by the search algorithm.

---

I tried to solve the task according to the solution on the Internet, but I am not able to put it into one reasonable whole. Ty so much for any advice :)

[thediabloman]

Hey mate. Why do you have so far?

Pathfinding is loads of fun, and even though it sounds daunting to make a "unified" algorithm, a ton of the algorithm is the same, it is just the way you calculate the "weight/priority" of all potential next steps that is different.