Introduction - If you have any usage issues, please Google them yourself
The program algorithm is relatively simple, can apply for a 2-dimensional array, as an abstract grid, made an attempt this procedure, about 2 dimensional array into a one-dimensional, but still can be obtained by integer division and modulo with the corresponding two-dimensional the ranks of the array values. The problem algorithm is a variant of the classic maze. Only to determine the rules of the rules and walk out. To solve basically the same idea. There are requirements from the current point 4* step (step is the biggest step) option (if it exists, or not to go to the grid boundary) using back through all of the circumstances, to obtain maximum output.