note
hossman
That's why I'm not clear on the goal, is it:
<blockquote>
Find an algorithm, whose performance is inconsequential,
that can determine the minimal number of moves to sort
the tapes.
</blockquote>
Or is it something like:
<blockquote>
Find an optimal algorithm for sorting the tapes such that
the only atomic operations <code>move(m,n)</code> and
<code>examine(n)</code> -- which tells you what tape is
in slot n.
</blockquote>
<p>
If any amount of preprocessing and analysis is allowed,
then any number of hueristics could be useful for find
a path from the starting order to sorted order.
<p>
If nothing else, you can do a breadth first search
of all the possible permutations of moves untill you
achieve the desired ordering.
144470
144519