I am trying to solve the following problem, but I am not exactly sure what approch to follow. I would really appriciate if you could share any suggestions, refference materials that would help me to solve it.\n\nProblem: Lets say you are given matrix like this.\n\n.....@...S\n....@.....\n@.....@..@\n...@....@.\n.F......@.\n.@........\n.......@..\n.@.@..@..@\n@.........\n.@@.....@.\n\nS: Start\nF: Finish\n@: Obstacles\n\nEach turn you have to choose one of the four cardinal directions to move. You have to keep moving in the choosen direction until you hit the wall surrounding the area, or one of the Obstacles. implement an algorithm which finds a shortest path from the start to the finish.\n\nThe final output should look like this.\n\nMove left to (7,1)\nMove down to (7,2)\nMove left to (6,2)\nMove down to (6,10)\nMove right to (8,10)\nMove up to (8,8)\nMove right to (9,8)\nMove up to (9,6)\nMove left to (3,6)\nMove up to (3,1)\nMove left to (1,1)\nMove down to (1,2)\nMove right to (4,2)\nMove down to (4,3)\nMove left to (2,3)\nMove down to (2,5)\n\nAlso if there are any similar questions in Leetcode, please share as well.

I am trying to solve the following problem, but I am not exactly sure what approch to follow. I would really appriciate if you could share any suggestions, reff