How do I find path using 2d array maze in java
问题 B B B B B B B B O B B B S O B B O O B B B B X B B Here, S = Start Point(2,2) B = Block O = Open X = Exit I want to make a maze that will check north, west, east and south. if X is around it will return the program. If not, then check for any 'O' around the start point and pass the new start point recursively. It there is no way to go and 'X' is not found it will go back to the original start point(2,2) and check west, east and south. after the program, i got: B B B B B B B B + B B B + + B B O