With fast on two and slow on one, the distance between them changes by exactly one every step, so once both are inside the loop that distance has to pass through zero and the pointers land on the same node within a single lap, wherever each of them started. Three steps to one changes the distance by two, and that can step over zero forever: start fast one node ahead, a common variant of the setup, and the gap stays odd, so on a loop of even length the two pointers never meet. Starting both at the head happens to avoid that case, but a second reason survives it. Finding the loop entry needs fast to have walked exactly twice as far as slow, and at three steps to one the meeting point no longer sits where that argument puts it.