Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: Re: sort with fewest moves

by axelrose (Scribe)
on Feb 11, 2002 at 19:26 UTC ( #144676=note: print w/replies, xml ) Need Help??


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

> is move(n,m) the only operation with a "cost" ?

Practically yes. Finding the right order is easily achieved with Perl in memory. The cost mainly results from time a robot arm needs to pick and move a tape. (about 30 seconds)

I neglect the time difference for tape moves betwenn different slots. (a maximum of 60 tapes)

> Would a solution that analyzed all of the slots in detail first,then built up a list of moves be considered optimal?
Yes - that's how I want to solve it.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (3)
As of 2020-04-04 03:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    The most amusing oxymoron is:
















    Results (32 votes). Check out past polls.

    Notices?