Do this with a greedy algorithm.
Use the OSGB grid coordinates for each postcode for best results.
1. Pick postcode in middle of the country and add it to the set P.
2. Pick another postcode not in P whose minimum distance to any
postcode in P is maximal, and add it to P.
3. Repeat step 2 as long as you like.
4. The set of postcodes becomes progressively more dense as you go
down the list. You may want to record the minimal distance from step
2 in the same table to make it possible to estimate this.
JT