When we generate a maze we aren't sure if the maze is actually solvable, which can cause issues where players are given an unfair game or cannot finish.
To avoid this, we need a form of check that ensures the distances for all players, are similar, and that each player has a route they can take to reach the victory state.
I suggest that we do some research into state machine, that would check if the maze is feasible, before passing it to the players, and if not, proceed to generate another maze.
This may cause an issue where generation of a map takes longer and could cause runtime errors.
When we generate a maze we aren't sure if the maze is actually solvable, which can cause issues where players are given an unfair game or cannot finish.
To avoid this, we need a form of check that ensures the distances for all players, are similar, and that each player has a route they can take to reach the victory state.
I suggest that we do some research into state machine, that would check if the maze is feasible, before passing it to the players, and if not, proceed to generate another maze. This may cause an issue where generation of a map takes longer and could cause runtime errors.