Addendum to 15-381 Problem Set 1
Please check the web page from time to time:
http://www.cs.cmu.edu/~jgc/15381/

 We will announce how to hand in your files on the course web page when
available.

To facilitate grading we have established input and output conventions
for this assignment.

Command line:
mysearch <searchtype> <gridname> Sx Sy Gx Gy
<searchtype> ::= {BFS|DFS|BestFS|BiBFS|Island-BFS}
<gridname> ::= path of file

Output:
Sx Sy
x1 y1
x2 y2
...
xn yn
Gx Gy

where:
* Sx Sy are the coordinates of the start state,
* x1 y1 are the coordinates of the first step in the path after the
start state,
* xn yn are the coordinates of the last step in the path before the goal state,
* Gx Gy are the coordinates of the goal state.
Numbers output must be integers, with x and y coordinates separated by a
single space, and the y coordinate followed by a newline character (\n).

Depth-first search should search nodes in the order North, South, East,
West. Any search needing to break ties should also search N, S, E, W.
For example, if in BestFS moving South and moving West result in the
same Manhattan distance, move South first.

Note: We will be running your program and dozens of others against
several test cases, so please include exactly the input & output
behavior specified above - no more, no less!  ***We may deductup to 5
points for failure to follow the input & output requirements.***


Addendum to the Addendum:
coordinate conventions:
 x = row
 y = column
 (0, 0) is top left state