Some properties of the set of vertices not visited by a random walk on the cube are considered. The asymptotic distribution of the first timeQ this set is empty is derived. The distribution of the number of vertices not visited is found for times nearEQ. Next the first time all unvisited vertices are at least some distanced apart is explored. Finally the expected time taken by the path to come within a distanced of all points is calculated. These results are compared to similar results for random allocations.