Viewing profile — dhartmei

Brute-force says the hardest puzzle for n=6 is [1,6,3] with a minimum of 14 moves. And for n=7 it's [5,4,1,2,7] with a minimum of 26 moves.

At the beginning, where the hidden passage is explained, isn't there a "race condition", where Ali Baba would eventually (across 40 repetitions) run into the thief? The thief picks…

Here's an example if you want to try http://www.benzedrine.ch/pi-spigot.c

You don't need arbitrary precision, use a spigot https://en.wikipedia.org/wiki/Pi#Spigot_algorithms