Help with block code for robot that can navigate to maze finish and get back to the start

[thailog]

Hello,
I’m struggling with this task : Program the robot, so that it gets to the goal. Use the “Dynamic Maze with Walls” course.

Is there anybody that can do this task?
Thank you so much for any help!

[Joeboticswastaken]

I have done this as well, it is very tricky but I recommend you persevere as I did. I am useless at coding but after a lot of work, I managed it. If it is for a class, I recommend you ask a classmate or a teacher as they will be able to give you an answer where you learn it better. Trust me, the feeling of satisfaction after figuring it out is worth it

[Foster]

Dynamic Maze Programming

Before I give my students this final project. I need help with the solution. note: in vex vr threads python rather than block code. I have coded it in around 8 lines, but I can’t seem to shorten it. I have heard it is possible to do it in under 6 not including VR threads if anyone could help me out I would appreciate it. Thank you, Ryan Riddling

From two years ago. Search is always your friend on the forum.

[antiq]

This sounds like pathing problem… try looking into a few of these algorithms:
Easy - Depth-first search
Medium - A* Algorithm
Hard - Dijkstra’s Algorithm

Actually, fact check on Dijkstra’s, because I’m pretty sure A. It finds the smallest distance between two points and B. it has terrain and a lot of other stuff you don’t need.