dhartmei

4 ms·

1. 1.▲
   by dhartmei 2y ago

   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.
2. 2.▲
   by dhartmei 4y ago

   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 one branch, Ali Baba the other. The thief us
3. 3.▲
   by dhartmei 8y ago

   Here's an example if you want to try http://www.benzedrine.ch/pi-spigot.c
4. 4.▲
   by dhartmei 8y ago

   You don't need arbitrary precision, use a spigot https://en.wikipedia.org/wiki/Pi#Spigot_algorithms
5. 5.▲
   A novel packing heuristic based on rigid body simulation(benzedrine.cx)

   8 points by dhartmei 12y ago|0 comments