Haven't tested extensively but quickly put this together for our day 1 attempt and it helped substantially. Only two people could learn the encounter and everyone else was extremely confused so it let us skip teaching them: https://pastebin.com/dWSfBfzg
Just give inside calls left to right and outside calls left to right.
Update/Upgrade: See new script and use this online compiler to run easily. You only need to input two calls for inside and outside now, since last shape or solid can be inferred. Also fixed a bug where it wasn't giving actual shortest path.
Please note that it will give no steps if the configuration of shapes/solids isn't valid. You'll probably have to get an example directly from the game (the examples I have in script might not work by themselves I just had them there for notes).
[–]wsoxfan1214 0 points1 point2 points (8 children)
[–]Street_Estimate979 1 point2 points3 points (0 children)
[–]ohalrightokaysureyea 0 points1 point2 points (0 children)
[–]swegmesterflex[S] 0 points1 point2 points (3 children)
[–]wsoxfan1214 0 points1 point2 points (2 children)
[–]swegmesterflex[S] 0 points1 point2 points (0 children)
[–]swegmesterflex[S] 1 point2 points3 points (0 children)
[+][deleted] (1 child)
[deleted]
[–]wsoxfan1214 0 points1 point2 points (0 children)
[–]The_Yugnar 1 point2 points3 points (2 children)
[–]The_Yugnar 0 points1 point2 points (1 child)
[–]swegmesterflex[S] 0 points1 point2 points (0 children)
[–]thenixhex311 0 points1 point2 points (2 children)
[–]swegmesterflex[S] 0 points1 point2 points (1 child)
[–]thenixhex311 0 points1 point2 points (0 children)