This is an old one. It demonstrates the use of clones to find the shortest path to the treasure. The trick is to force it to be a breadth-search with the [wait (0) secs] block. I don't remember the exact details of why this works. This trick was also used in my AI vs Humanity remix. One of the benefits of using clones for path finding is that you don't need a list, but it's kind of slow, and that's why I didn't share this project back then.
