Hi folks !
A tutorial about recursive backtracker in vex to create mazes. The idea is simple :
You get your adjacent neighbours and check if they are not visited, if not, you randomly choose one and move to it.
If no valid neighbours, you backtrack the stack of your previous positions and check if there is a valid neighbour until you find one.
If the stack is empty no valid cells are left so the maze is done.
recursive_backtracking_001.hiplc