CSCI 160 Assignment 8,   Fall 1996

DUE:  
The assignment is due on or before 3am, Thursday December 5.  This
assignment is worth 20 objective points.  Your solution will be graded
on the basis of its run-time behaviour and on the clarity and
simplicity of the source code.  See the marking guide in
~csci160/Pex8/markingGuide. With regard to simplicity and clarity,
follow the ASAP principle: as simple as possible.

INSTRUCTIONS:
Issue the command:
               cp -r ~csci160/Pex8 .
to copy the assignment work directory to your account.  Locate to Pex8
and use the  CSCI 160 Exercise Development Utility to test, verify and
submit you assignment (enter the command  make help for instructions on
how to use the utility). 

This assignment is to completed by each student.  Submit only one
implementation; if you send more than one, we will discard all but the
last one.  The assignment identifier is  CSCI 160 Pex 8 (see Course
Information Sheet).  Your assignment  must be received before the due
date and time.  In addition, your e-mail  must have the assignment
identifier as its subject.  All other methods of submission will not be
accepted.  You will receive no credit for an assignment submission that
fails to adhere to this convention.

QUESTION:
Description
===========
Assume a maze is a rectangular enclosure divided into squares. Each
square is either covered by a hedge or is part of a walk-way. The
objective is to determine if there is a path from the start of the maze
to the finish.  You can move from square to square in any direction
(up, down, left, right).  You may NOT move diagonally.  The maze is to
be represented as a two dimensional array of characters.  A walk-way in
the maze is represented by the character '.'.  A hedge in the maze is
represented by the character 'H'.  Your task is to write a Pascal
program that reads the maze and determines if there is a path from the
top left hand corner  of the maze to the bottom right hand corner.
Sample Output
=============
Enter the number of rows 5
Enter the number of columns 5
Enter the contents of the maze 
(character by character, one row per line)
..HH.
H.HH.
H....
H.HH.
H..H.
There is a path from start to finish

Enter the number of rows 5
Enter the number of columns 5
Enter the contents of the maze 
(character by character, one row per line)
..HH.
H.HH.
H....
H.HH.
H..HH
There is NO path from start to finish
Assumptions/Restrictions 
========================
Input data need not be validated.  The maximum size of the maze is 10
by 10.  The minimum size of the maze is 1 by 1. You may assume that the
upper left hand corner is part of a walk-way. You must use recursion
to advantage to search for the required path.
Test Set 
======== 
see ~csci160/Pex8/tinp