A probabilistic algorithm, called the q-hook walk, is defined. For a given Young diagram, it produces a new one by adding a random box with probabilities, depending on a positive parameter q. The corresponding Markov chain in the space of infinite Young tableaux is closely related to the knot invariant of Jones, constructed via traces of Hecke algebras. For q = 1, the algorithm is essentially the hook walk of Greene, Nijenhuis, and Wilf. The q-hook formula and a q-deformation of Young graph are also considered.