I agree with the other two comments. This is a fun simple game and the entire time I was thinking "This is brilliant! Why didn't I think of this?" If you do future iterations of this, I would like to see what the computer thinks would be the best path. But if you don't come back to it, this is a great game, keep up the good work!
Thanks for the feedback.
I've actually thought about adding a solver that simply brute forces the solution by going through all the variations, but then I realized that there are 1606 octodecillion (4^100) possible combinations for a 10x10 maze, which I think is a "bit" much.
With a proper algorithm that solves the maze in a non-stupid way by discarding all variations that aren't solveable in the first place this is probably doable though. Might be a fun coding challenge when I have some spare time.
You could probably do it recursively. Define a start point (such as the beginning arrow). Find every combination that Connects to that point(X/4)(skip this if the connector has 4 connections), Define each of the outputs as a new start point. Push onto a stack of start points with start points that don't go closer to the end point on top. repeat. At the end add the combination that lead to the longest path to the end point, then add any other combinations that create the longest paths of dead ends. There is a fun YouTube video that I saw about a program that solves mazes that does it pretty similarly.