Results for round 1

Programs were tested by running each with 30 graphs for 10 minutes. 10 of the graphs had a frequency assignment of size 8, 10 had an assignment of size 11 and last 10 had assignment of size 13.

The quality of a solution was calculated with the formula penalty = 1000 * (found - optimal) / (degree +1 - optimal) where degree is the maximum node degree in the graph (every graph has a colouring of degree+1 that can be found with a greedy algorithm). The penalty score of solutions were summed over all instances and extra points granted according to the total value.