how to create a java program that navigates a maze

Maze Navigation program

Your program will navigate a maze. The path from the start to the destination (if possible) will be stored in a stack. The maze will be an N x N matrix containing 0’s (path) and 1’s (wall). Given a starting coordinate, the program can only move vertically or horizontally, not diagonally, along a path. When the destination coordinate is encountered, stop the movement and print the pathway coordinates through the maze. If the destination is not encountered, print a statement to that effect.

Two test files are attached, one with a successful path, maze1.txt and one without, maze2.txt. The files have the following format:

Line 1 contains N, the number of rows and columns in the maze,

Line 2 contains the row and column of the starting point,

Line 3 contains the row and column of the destination point,

Remaining lines contain the maze, one row per line.

 

Do you need a similar assignment done for you from scratch? We have qualified writers to help you. We assure you an A+ quality paper that is free from plagiarism. Order now for an Amazing Discount!
Use Discount Code "Newclient" for a 15% Discount!

NB: We do not resell papers. Upon ordering, we do an original paper exclusively for you.