need some help on this problem - a few hints please

[alvarorahul]

i was given d this prob. as a proj.Pls give some hint how to get about it : -
there is a 3D maze(n*n*n;n is odd).there are some hindrances(1)to be avoided. the starting position is to be chosen and d objective is to reach the centre of the maze. if it is not possible to reach then print "NO" else print "YES" and find the shortest path.
eg.
----------------
1 0(start) 0
0 1 0
1 1 1
--------------------
1 0 1
1 0(destn) 0
0 1 0
--------------------
0 0 0
1 1 0
1 0 0
--------------------
output: Yes,3

[Magos]

Make a google search for the A* (A-star) algorithm. It can find the optimal path through a labyrinth assuming one exists.

As a sidenote, I implemented A* in a program. It can be found here:
http://momm.seiken.co.uk/forum/index.php?showtopic=1883

That program uses a 2D maze, but I don't think it's hard to extend to 3D.