The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We construct optimal heuristic algorithms for this problem in both the randomized and deterministic settings (a heuristic algorithm may err on a small fraction 1/d of the inputs; the parameter d is given to it as an additional input.) Thus for this problem we improve an earlier construction of an optimal acceptor (that is optimal on the negative instances only) and also give a deterministic version. Bibliography: 12 titles.