Python specifications

For this assignment, Python has looser specifications compared to Java. Input is going to be name of a file containing the maze's map in text format and name of the file that the output is to be written to. Expected output is a text file with the path, on each line a single position (see details below). Everything else is up to you.

Your task is to design and implement player, that can find path in the maze from place A to place B. Ideally, the path should be optimal (shortest possible) and the player should find it in shortest possible time.

You turn in file findpath.py together with any other modules it needs to run. Create an archive of all the files.

Your main module, findpath.py file has to accept two input parameters:

1. name of the file containing map of the maze
2. name of the file it writes its output to

Path has to

1. Start at the starting point and end at the goal point.
2. Has to be continuous
3. Must not go through a wall.

Output form

1. column, row (one position per line)
2. or string None in case there is no path

There is more information in the findpath.py you can download at the bottom.