Matlab
First step is to create maze
This is done using seed where every odd square is possible start of wall. We than select one of the yellow squares and start doing wall until we hit one wall or until some predetrmined length(this length has to be even). This will give us maze with at least one path from every two squares in maze
After maze is build we can try to solve it. Here is used algorythm which will try to go closest unvisited square to the end. Which means that sometimes we will go to dead ends before going right way. Or that we cannot be sure if we found shortest overall.
Full maze functinality. Building from base block, selecting start and end point. Solving maze
More algorythm will be added in future