Hi

I am a 4th year and have been given a project involving solving a maze (using C language). I have never done C before although i have done about 6 months of JAVA.

Any help to the following would be greatly appreciated.

Here is the layout which we were given.

We get given an input file which is layed out as follows:

20 20 (this is the size of the maze, 20x20)

4 7 (this is the starting point of the maze)

7 20 (this is the end point of the maze)

5 7 2 9 4 6 .......

4 6 8 6 8 9 ........(20 rows of numbers and 20 columns of numbers giving each sqaure of the maze the info it needs)

so 6 would be 0 1 1 0 in binary which would mean the north direction hasnt got a wall, West has a wall, South has a wall and East hasnt got a wall.

We have to get to the end in the quickest route possible.

I have come up only with this so far... i have no idea how to implement it...

say function checksquare(grid reference)

if grid reference has been looked at, go back

for each square connected to this one

if connectdsquare = = endsquare, maze has been solved

else checksquare(connectedsquare)

end for

end function

i have no idea how to implement this!!!!

any help would be so greatly appreciated

thanks

jonny