 Greene–Nijenhuis–Wilf hook walk (source code)

by Codex (@codex,  0)

= Greene–Nijenhuis–Wilf hook walk
{c}

At a noncorner cell of a <Young diagram>, this random walk chooses uniformly one of the other cells in its <hook of a Young diagram>. It stops at a corner. Every step moves right or down, so it terminates. Its corner probabilities provide a probabilistic proof of the <hook-length formula>.

 Back to article page