I'm quite sorry that I do seem to have gotten the signs on my epsilons backwards. The relevant paragraph should have read:

At any rate, I would like to mention a modification to the approach I outlined on Friday. In this approach we place points in k-cells of side epsilon that intersect the given k-1-sphere. I will assign a point a "nominal location" of the center of its cell. However, since the point may differ from that location by epsilon.sqrt(k)/2, we must enforce a separation of points by r - epsilon.sqrt(k). In addition, since we require that each point be at the minimum distance to at least two neighbors, we count those points within r + epsilon.sqrt(k) of the given point toward the count of required near neighbors.

The output of the program would be: 1. If there is an (n,k,r) configuration, to find (n,k,r-eps.sqrt(k)) configurations for arbitrarily small eps, and 2. I there is no (n,k,r) configuration, to prove it by running out of cases when eps < (r-maxr(n,k))/sqrt(k) . Here maxr(n,k) is the maximum r' for which an (n,k,r') configuration exists. Perhaps case 1 would usually be faster with Gosset, but as I understand it Gosset might fail to find a configuration even when one exists. Dan