Report Number: CS-TR-72-286
Institution: Stanford University, Department of Computer Science
Title: On the solution of Moser's problem in four dimensions, and related issues. A collection of two papers: On the solution of Moser's problem in four dimensions and Independent permutations as related to a problem of Moser and a theorem of Polya.
Author: Chandra, Ashok K.
Date: May 1972
Abstract: The problem of finding the largest set of nodes in a d-cube of side 3 such that no three nodes are collinear was proposed by Moser. Small values of d (viz., $d \leq\ 3$) resulted in elegant symmetric solutions. It is shown that this does not remain the case in 4 dimensions where at most 43 nodes can be chosen, and these must not include the center node.
http://i.stanford.edu/pub/cstr/reports/cs/tr/72/286/CS-TR-72-286.pdf