Top-k keeps a small branch list by exact ordering. This lesson uses k equal to two on the first displayed step and keeps the branch rule separate from probabilities.
highlighted = computed this step
Top-k
Top-k keeps the k largest logits instead of only one token. The ordering is still exact integer comparison. It broadens the branch set while staying deterministic for the displayed logits and tie-break.
top-k=largest logits by exact order
Top two at the first step
For k=2, the first step keeps a with logit 3 and c with logit 2. Token b is outside the top list because its displayed logit is lower.
top-2=[a(3),c(2)]
Summary
Top-k broadens the displayed branch list, but it still uses exact ordering of the same integer logits. No softmax weight is needed to decide the shown top-k set.