Let p be a prime and let c be an integer modulo p. The Pollard generator is a sequence (un) of pseudorandom numbers defined by the relation un+1equivun 2+c mod p. It is shown that if c and 9/14 of the most significant bits of two consecutive values un,un+1 of the Pollard generator are given, one can recover in polynomial time the initial value u0 with a probabilistic algorithm. This result is an improvement of a theorem in a recent paper which requires that 2/3 of the most significant bits be known