Classic right-hand rule plus an optimization to skip known dead ends. 3850/61/545.

First solution I finally got with 7007 cycles, 79 size, and 479 activity. After a lot of compression and another completely different approach, I got my fastest with 5627 cycles and 60 size while my smallest is at 6254 cycles and 54 size. No wonder this puzzle is at the top!

Finished it with 7465 cycles, 76 size, 563 activity. Nice puzzle.

58 lines of code

i had a kinda scrappy design, but i developed a tree data structure to map it out, fun challenge

Nice maze. Kept my brain burning 3 or 4 hours. Finally solved it with 99 lines of code. However, some others were nearly twice as fast. ;)

Finaly!!! had to constantly reinvent solution to cut lines of code and three times I thought I had it done, press FFW and bam. No comprende.

And then again trying to figure out how to rewrite the code to stay under 100 lines.

And after all that torture I finaly did it just to find out that someone did it faster... DAMMIT!!!!

Maze-puzzles are fun! - thx for this . . .

my approach on this one:
one master stays home, spawns scouts and remote-controls them to their fate - and keeps track of the good path in a file. As a refinement I also added the host-names to the file to delete loops, if the scout has been there already.

@Distracted Unfortunately with hosts, even if a number is given for its name, HOST still returns a keyword. The other issue one may encounter with that is two hosts cannot have the same ID.

The way to do that by design would be 2x1-sized hosts with a register in there you can read for linkage data. In the meantime, many EXAs die to bring you this information!

@Unit 502 What do you mean? You can test connections as usual by using them and checking for success.

I solved it! My solution sucks compared to the clever ones, but it works! :D

there's definitely at least one way

@Austin
ahhhhhh

@gratatoedo You can use the REPL command, but the *size* of the nodes in the maze (1x1) is what prevents a simple flood-fill from solving the maze.

Clever way to prompt me to implement a particular data structure. Nice!

...without the luxury of REPL once your EXA has started...
why