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.
(In reply to
re(3): So at least the first 32 are reachable... by McWorter)
This may be interesting: http://wwwhomes.uni-bielefeld.de/achim/no3in/readme.html
Edited on May 20, 2005, 6:48 pm
|
Posted by Hugo
on 2005-05-20 18:42:04 |