Hey,
The question came up on Cosmo's stream for when you are entering the random warp and hoping to land on Outset of when it makes sense to just sail from where you landed, or to reset and try again. I thought it was an interesting probability problem so I took a stab at answering it.
First, a couple of assumptions:
1) The goal is to minimize the expected total time that it takes to get to Outset Island. This might sound obvious but it may not be the case; for example, if you're only trying to minimize the best time you ever get, and you don't care about restarting the whole run, it would make sense to do one warp and start all over if you don't get to outset. But this takes so long that I think this goal is reasonable.
2) Each warp point is equally likely, and it always takes exactly the same time to sail from that warp point to Outset. Someone would have to check these to see if they're not true.
With that in mind, we know there are 7 possible warp locations, let's call them A through G, and say T(A) is the time to sail from A to the final goal of Outset. Let's call T(R) the time it takes to reset the game, open the file, sail back to the warp tornado, and land at another random destination.
Once you've landed at a random destination Q, you want to know if you should sail to Outset or reset the game and try again. Sailing takes T(Q), a constant value. If you reset, it will take time X, where:
X = T(R) + 1/7*Min(X, T(A)) + ... + 1/7*Min(X, T(G)).
Explanation: T(R) is the time to reset and try again. From there, we have a 1/7 chance of reaching each destination, and the expected time from there depends on whether it's faster to sail or try again from that new destination, which is why we have to take a minimum.
So, we just have to solve for X (since it's a function of itself). The easiest way to do this is to plug the actual values for T(A) through T(G) and T(R) into the equation and give it to Wolfram Alpha. I did this for some sample values (in seconds):
T(A) = 100
T(B) = 200
T(C) = 300
T(D) = 400
T(E) = 500
T(F) = 600
T(G) = 700
T(R) = 50
Then as per
http://www.wolframalpha.com/input/?i=x+%3D+50+%2B+1%2F7*minimum%28x%2C100%29+%2B+1%2F7*minimum%28x%2C+200%29+%2B+1%2F7*minimum%28x%2C+300%29+%2B+1%2F7*minimum%28x%2C+400%29+%2B+1%2F7*minimum%28x%2C+500%29+%2B+1%2F7*minimum%28x%2C+600%29+%2B+1%2F7*minimum%28x%2C+700%29, X = 950/3 = 316 2/3.
So with these fake numbers, you would sail to outset if you land on A, B, or C, and reset otherwise. This makes sense if you think about it - A, B, and C are the closest to outset, but the others are so far that you're better off taking the 50 second hit and trying again.
Now the only thing remaining is to find the actual values for T(A)-T(G) and T(R) and plugging them in. I don't have the game though so I'll leave that to someone else if they want to figure it out. Hope this is useful.