Recursion, matrices, Graph theory.... I need advanced help please

Question

Okay, I am practicing for a coding contest, and there is one particular part that I have never been able to code right, and it deals with matrices, and navigating through them in a graph like manor. Can anyone help me, or refer me to a place where I can find someone who can? If so, that would be great and thanks!

Answer 1

@Matthew , U can submit it as an assignment in lesson factory
//but might Oma already submitted like that .

👉I figured out my way to solve it , might not the most efficient but will solve it easily by counting steps needed for each combination of the moves possible

Answer 2

Sounds interesting. How much experience do you bring to the table? If I give an algorithm, you would be able to code and make it run.

Answer 3

Click on people icon to look at active mods and you will see my picture.

Answer 4

Could you join Discord so we can chat there. It allows direct messaging so conversation is more convenient.
https://www.sololearn.com/Discuss/689391

Answer 5

Here is the competition text-

Program Name: Maze.java Input File: maze.dat
In computer science, mazes are closely related to the study of graph theory. A typical maze forms a graph in the shape of a square lattice. Each node in the maze is only connected to the four nodes directly adjacent, meaning you can only travel left, right, up and down. Our maze is unconventional; instead of the ability to move one space in each direction (up, down, left, or right), you can move two spaces in each direction (up, down, left right), one space right, or one space up. This diagram shows the moves you can make:

You are to determine the least number of steps required to move from the start of the maze to the end of the maze.
Input
The first line will contain a single integer n that indicates the number of data sets that follow. Each data set will start with a single integer s describing the size of the maze. The next s lines are a description of a square maze of size s. The characters in the maze are representative of the following:
‘S’ is the starting point
‘E’ is the ending point
‘.’ is a point you can move to
‘#’ is a point you cannot move to

Output
Output the minimum number of steps required to reach the end of the maze. If the maze is unsolvable output ‘NOT POSSIBLE’

Example Input File
3
3
#S#
###
#E#
5
###S#
##..#
#.E##
###.#
###.#
7
#######
...##.#
#..##..
.#..#..
#.##E#.
.######
..S.###

Example Output to Screen
1
NOT POSSIBLE
10

Answer 6

I am strong with all java from basics through oop, and Sort algorithms, and know a good bit about data structures, just never was strong in Matrices.

Answer 7

Alright, i'm on, how do I find you?

Answer 8

Oh, when I logged into the PC sololearn I logged into the wrong account, I am Clint.

Answer 9

Hello
This is my normal account.