In AG1, we use a simple beam search to discover proofs. In AG2, we design a novel search algorithm, called Shared Knowledge Ensemble of Search Trees (SKEST), to allow multiple beam searches to run in parallel and help each other. This was one of the reasons why we can solve IMO

→ View original post on X — @lmthang