One of the problems they were approaching was the cap set problem https://en.m.wikipedia.org/wiki/Cap_set https://en.m.wikipedia.org/wiki/Cap_set > The proble

One of the problems they were approaching was the cap set problem https://en.m.wikipedia.org/wiki/Cap_set https://en.m.wikipedia.org/wiki/Cap_set > The problem consists of finding the largest set of points (called a cap set) in a high-dimensional grid, where no three points lie on a line. This problem is important because it serves as a model for other problems in extremal combinatorics - the study of how large or small a collection of numbers, graphs or other objects could be. Brute-force computing approaches to this problem don’t work – the number of possibilities to consider quickly becomes greater than the number of atoms in the universe. > FunSearch generated solutions - in the form of programs - that in some settings discovered the largest cap sets ever found. This represents the largest increase in the size of cap sets in the past 20 years. Moreover, FunSearch outperformed state-of-the-art computational solvers, as this problem scales well beyond their current capabilities.