hi! could anybody help me, a hint at the least
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
