using System;

namespace PathFinder

{    class Program

    {        static int[,] A = new int[4, 4]{{1,1,0,1 },{1,0,1,0 },{1,1,1,0 },{0,0,1,1}};

        static int[,] path = new int[4, 4];

         static  int findPath(int i, int j, int n)

        {            if (i == n - 1 && j == n - 1)

            { path[i, j] = 1; return 1; }

            if (A[i, j] == 1)

            {   path[i, j] = 1;

                if (findPath(i, j + 1, n) == 1) return 1;

                if (findPath(i + 1, j, n) == 1) return 1;

                path[i, j] = 0;

            }

            return 0;

        }

        static void Main(string[] args)

        {   findPath(0, 0, 4);

            for (int i = 0; i < 4; i++)

            {   for (int j = 0; j < 4; j++)

                    if (path[i, j]==1)

                        Console.WriteLine("({0},{1})-->", i, j);

            }

      }

    }

}

​