There is a n*n matrix in this matrix it's a mouse and a cheese in this matrix and some of the cell of the matrix is blocked (random) know we want to find out if the mouse could reach the cheese or not if so showing the way what is the best way to find it in the minimum time.
n and the place of mouse and cheese will be given by the user.
I know so so about programing please don't use professional tools.
thanks for your guide.
0 · ·