ajay@cs.Buffalo.EDU (Ajay Shekhawat) (03/09/91)
I'd like some info on the N-queens problem (how to place N queens on a N x N chessboard, so that they don't attack each other ; N >= 4 ). Is it possible to do better than a brute-force search? On a related note : I'd like references to the following problem: I'd like to pick N integer points (points with integer coordinates) so that no three of them are collinear. What is the size of the smallest square grid that is necessary? Clearly the grid must be atleast N/2 x N/2 . Any help would be appreciated. If there's sufficient interest, I'll post a summary of responses. Ajay.. Ajay Shekhawat <Dept. of Comp. Sci., SUNY@Buffalo, Amherst, NY 14260> ajay@cs.Buffalo.EDU || ajay@sunybcs.BITNET || ajay@sunybcs.UUCP || 716.636.3180