Imagine a 3- dimensional grid with NxNxN points.
Place as many points as possible on this grid, such that there are no 3 points in a line. For N=2, this is of course 8.
In the earlier problem, it was proved that for N = 3, 4, and 5 this was respectively 16, 24, and 38.
How much is it for N = 6, 7, or 8?