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 …

Can you post your code here, and elaborate on the project that you need help with? Make sure to format your code by enclosing it in 3 diacritics (`) for readability, like this.

Sure thing the project is called Dynamic Wall Maze on vex.vr. Here is what I have so far: def main(): while not down_eye.detect(RED): if right_bumper.pressed(): drivetrain.turn_for(RIGHT, 90, DEGREES) drivetrain.drive_for(FORWARD, 200, MM) else: drivetrain.drive_f…

I don’t see a way for the code as written to escape the starting hallway. It seems to me you would need to evaluate open pathways at each square. Perhaps even an array to evaluate if you have been to a square already.

Do you have any ideas on how I could implement that I am experienced in python but I have been only using vex python for a the past week.

Check out this article: Maze-solving algorithm A maze-solving algorithm is an automated method for solving a maze. The random mouse, wall follower, Pledge, and Trémaux's algorithms are designed to be used inside the maze by a traveler with no prior knowledge of the maze, whereas the dead…

Generally, the simplest algorithm is the one above. Have a sonar on the right side of the robot so it tracks the wall on the right of it, and a front bumper to detect collision with the wall. I think something like this should work Pseudocode: While true{ If front bumper is pressed -> back up a …

The VEXcode VR robot only has front facing bumpers and distance so you’d need to evaluate each square independently.

[image] SCFarrell: you would need to evaluate open pathways at each square. That’s the only way I’ve found to do it. It’s super slow unfortunately, but I haven’t seen a better way. Just stopping at every square and turning to check if there is a wall, and if there isn’t going forward. And the…

Was involved in micromouse competitions many many years ago. in fact, when I was in university, this was the only robotics competition available for students. Anyway, what @holbrook mentioned is the wall-following algorithm. It is easy to implement and widely used. For micromouse, the end goal is…

Now that I’m not on mobile I will link my code-golfed blocks solution to the dynamic maze: [image] VEX VR challenges - tiny programs VEXcode VR Support Ooh, this sounds like fun! Here’s a maze solver in 7 blocks (using the classic wall-following technique ): [Screen Sho…

Dynamic Maze Programming

Programming Support

holbrook May 25, 2022, 12:50am 11

Now that I’m not on mobile I will link my code-golfed blocks solution to the dynamic maze: