Ensure that the Maze always has a solution. Start point to end point

[wahiqq]

Using the procedural generation method. Also implemented the check neighbors #where no cell can have all 4 walls and the algorithm ensures that we have solution always