Beam search just traverses different paths and assigns each path a probability of being correct. The paths with the higher probabilities are kept and the ones w

Beam search just traverses different paths and assigns each path a probability of being correct. The paths with the higher probabilities are kept and the ones with lower probabilities are pruned until the search terminates with an "answer". The marketing department calls it "reasoning" and "test-time compute" because the average consumer does not care whether it's beam search or something else. Your link seems to do a good job of explaining beam search but it's a classic algorithm in state space exploration so most books on search algorithms and discrete optimization will have a section about it.¹ 1: https://books.google.com/books?id=QzGuHnDhvZIC&q=%22beam%20search%22#v=snippet&q=%22beam%20search%22&f=false https://books.google.com/books?id=QzGuHnDhvZIC&q=%22beam%20s...