Here is an imgur folder with the projects description (my apologies for the awfully wrinkled paper): http://imgur.com/a/a2vQM
There are a set of pegs, numbered from 0 to n - 1. Each peg can have a connection to another peg with a rubber band.
Basically, the program is given an adjacency list with all of the pegs and the ones they connect to. The idea of the project is to come up with an algorithm that returns a permutation with the all of the rubber bands stretching the least distance.
It's my understanding that this program will take a long time to run. Our teacher implied that the algorithm should run multiple times to get the best answer; each result of the algorithm should improve the overall "cost". (The cost is the distance spanned by all of the rubber bands, measured in pegs. For example, a set of 5 pegs in numerical order that has one rubber band between peg 1 and 3 has a cost of 2). I've been struggling to come up with an algorithm that returns a "good" result. What I need is an algorithm that, when run an infinite amount of times, will improve the cost each time. If anyone recognizes the problem or has any suggestions, please let me know. Thanks!