Maze solver without arrays
We have a lab that asks us to solve a pre-designed maze which the instructor gave to us. The maze only has one answer, and the hint he gave us is to use Lee's algorithm aka BFS. We are not allowed to use arrays as we have not learned that yet. So my main question is, can anyone explain Lee's algorithm/BFS with code? i've looked at youtube videos and such, and they all use arrays. Any code with comments would help thanks.
- DN
- DN
Topic archived. No new replies allowed.