Kata

Find a path throug the maze. Start at point A and goto point B. There could be more than one possible path to point B. The goal is to find a way arround the walls. Point A and B can be anyware inside the maze.

Given will be a maze, made of a 2 dimentional array of chars.

Example maze:

[
  ['.','.','.','.','.','.'],
  ['.','#','#','#','#','.'],
  ['.','#','B','.','#','.'],
  ['.','.','.','.','#','.'],
  ['#','#','#','#','#','.'],
  ['A','.','.','.','.','.']
]

The starting point is marked with an upper case A, the destination will be marked with a upper case B. Walls will be marked with a hashtag #. Periots . will make passable spaces.

If you walk into a Wall (#) the test will fail.

Return the path as a string defining the way with the letters of the four cardinal points (lower case).

the directions are oriented in the way the maze is displayed inside the code.

n = North (negative y)
e = East  (negative x)
w = West  (positive x)
s = South (positive y)

(maze array first dimention will be y, second will be x)

Example path:

"eeeeennnnnwwwwwssseen"

If there is no available path return an empty string.

There will allways be exactly one starting point (A) and exactly one destination point (B).

The maze will allways be a rectangle. (No different line lengths.)

You cant go diagonal.

Mazes will be generated randomly!