I need a working and optimum code for the problem in question.

CLOSED
Bids
11
Avg Bid (INR)
1727
Project Budget (INR)
₹1500 - ₹1500

Project Description:
The problem in question needs to be solved using JAVA.
The code should be accompanied by a readme.txt file which has the instructions for executing the program.
Requirements :-
? Solving the problem correctly (should work for a wide/all possible variety of test input)
? Conciseness of the logic.
? Organization and structure of the code.
? An optimized code(both time and space optimized) is necessary.

Please look for the problem in the attached file.

Additional Project Description:
01/04/2013 at 11:43 EST
Instructions
1. Input will be a text file with the first line giving meta information. The first set of number will indicate size of maze. The second set will indicate entry point. A sample file is:
3,6 0,1
x xxxx
x xx
xxx xx
2. Above: 3,6 is the size of the matrix in number of characters. 0,1 is the location of the start point. X denotes walls and space denotes openings
3. The program will enter from the opening and get to an nearest exit (An exit is any opening on any edge except the one from which you came).
4. A nearest exit is the exit requiring minimum moves. A move can be to any adjacent empty space in surrounding 8 spaces (including diagonals)
5. At the minimum the program should print the series of co-ordinates which signify the successful path
6. Visual depiction of solving the maze.
7. If there is no solution, the program should indicate that.
Requirements :-
? Solving the problem correctly (should work for a wide/all possible variety of test input)
? Conciseness of the logic.
? Organization and structure of the code.
? An optimized code(both time and space optimized) is necessary.

Skills required:
Algorithm, Java, Usability Testing
About the employer:
Verified
Public Clarification Board
Bids are hidden by the project creator. Log in as the employer to view bids or to bid on this project.
You will not be able to bid on this project if you are not qualified in one of the job categories. To see your qualifications click here.