can anybody help me with this project ,

hints :

Here's the sample output

Matrix Representation of Sample Maze 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 O 1 1 1 1 O O 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 1 The rat-in-a-maze problem is to find a path from the entrance to the exit of the maze. A path is a sequence of positions, none of which is blocked, such that each (other than the first)is the north, south, east or west neighbor of the preceding position. You are to write a program to solve the rat-in-a-maze problem. You may assume that the mazes for which your program is to work are sufficiently small so that the entire maze can be represented in the memory of the target computer. Your program will be read in command line parameters containing filenames of maxes to process The first line of the maze file will be ROW COUNT COLUMN COUNT proceeding lines with be a matrix of 1's and 0's depending on if it is blocked or not. See one of the provided maze text files. You can assume that the input files have correct syntax. The command line arguments will be received as follows: mazefilel mazefile2 maZefilen If more then one file argument is provided, your program will process multiple mazes during a single execution