How to find the shortest path in 2D maze array, where direction is changed only when obstacle is hit

Question

I am struggling to implement an algorithm that resolves a 2D maze array by only changing a direction once a wall or another obstacle is hit.

What it needs to do is, given