Read the configuration of a maze, containing information about the grid size.
Budget: $30 – $250 USD
Program
The program to be developed should be able to read the configuration of a maze, containing information about the grid size, the location of the final cell, and the position of the black and grey cells, and generate a solution to the problem. It is assumed that cell (1, 1) is always the initial cell and that the end point must be a white cell. The solution consists of identifying the walls that must be demolished on the path between the start and end points, as well as indicating the final cost when a path is possible.
A supplementary note: the program should also be prepared to handle three special types of mazes: (i) those with no solution, i.e., those where there is no path to go from the initial from the initial cell to the final cell according to the rules of the game; (ii) those in which the solution has no cost, i.e., it is not necessary to break any wall to go from the initial point to the final one; (iii) those in which there is more than one solution - there is more than one path, crossing different walls, with the same final cost (in this case, as indicated above, any solution is acceptable). Note that the number of broken walls is not relevant in terms of the optimality of the solution; only the total cost matters.
If you have questions, please leave mea message
The program to be developed should be able to read the configuration of a maze, containing information about the grid size, the location of the final cell, and the position of the black and grey cells, and generate a solution to the problem. It is assumed that cell (1, 1) is always the initial cell and that the end point must be a white cell. The solution consists of identifying the walls that must be demolished on the path between the start and end points, as well as indicating the final cost when a path is possible.
A supplementary note: the program should also be prepared to handle three special types of mazes: (i) those with no solution, i.e., those where there is no path to go from the initial from the initial cell to the final cell according to the rules of the game; (ii) those in which the solution has no cost, i.e., it is not necessary to break any wall to go from the initial point to the final one; (iii) those in which there is more than one solution - there is more than one path, crossing different walls, with the same final cost (in this case, as indicated above, any solution is acceptable). Note that the number of broken walls is not relevant in terms of the optimality of the solution; only the total cost matters.
If you have questions, please leave mea message