Skip to main content

🎮 Beam Search (Practice)

Companion to the Beam Search & Constrained Decoding guide. Implement beam search over a toy probability tree. Edit and run the code right here — it executes in your browser.

🐍 Your turn​

Loading editor…

🧠 Challenge yourself​

  1. Compare beam=1 (greedy) vs beam=3 outputs.
  2. Add a length penalty so long sequences aren't unfairly punished.
  3. How does constrained decoding prune invalid tokens?

Continue the learning path → Graph Algorithms Kg Graphrag