actually i solved nxn maze problem using backtracking but my solution can find only one solution.I need to find all possible solution ,please any one tell me how can i do this using bfs as well as what changes i have to do for making my backtrack program so that i can find all possible solution.