For any grid, x by x, figure out a formula for the greatest number of points that can be put on the inside of the grid such that no three points are colinear.
Very cool variation McW. Maybe you should edit your post to remove the problem and submit this problem. I may have to wait a few months, but I'll look forward to it.
re(2): So at least the first 32 are reachable...
