The branching factor for chess is about 35.
For token generation, the branching factor depends on the tokenizer, but 32,000 is a common number.
Will search be as effective for LLMs when there are so many more possible branches?
For token generation, the branching factor depends on the tokenizer, but 32,000 is a common number.
Will search be as effective for LLMs when there are so many more possible branches?