Solve a maze automatically in c++ using arrays

Solve the following maze with the algorithm of your choice. The idea is to come up with a fully automated method to find the shortest path from S to E using minimum number of movements. Please, ? need c++ codes for this maze. And we are not allowd to use a arrays in this problem