Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re: Re: Re: sort with fewest moves

by hossman (Prior)
on Feb 11, 2002 at 01:03 UTC ( #144546=note: print w/replies, xml ) Need Help??


in reply to Re: Re: sort with fewest moves
in thread sort with fewest moves

That's why I'm not clear on the goal, is it:
Find an algorithm, whose performance is inconsequential, that can determine the minimal number of moves to sort the tapes.
Or is it something like:
Find an optimal algorithm for sorting the tapes such that the only atomic operations move(m,n) and examine(n) -- which tells you what tape is in slot n.

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.

If nothing else, you can do a breadth first search of all the possible permutations of moves untill you achieve the desired ordering.

Replies are listed 'Best First'.
Re: Re: Re: Re: sort with fewest moves
by theorbtwo (Prior) on Feb 11, 2002 at 01:16 UTC

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://144546]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (5)
As of 2022-01-26 19:50 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In 2022, my preferred method to securely store passwords is:












    Results (70 votes). Check out past polls.

    Notices?