>The first was a challenge in pure mathematics known as the cap set problem, which is about finding the largest set of points in space where no three points for

>The first was a challenge in pure mathematics known as the cap set problem, which is about finding the largest set of points in space where no three points form a straight line. FunSearch was able to solve this by churning out programs that generate new large cap sets that go beyond the best that mathematicians have come up with. >The second puzzle was the bin packing problem about finding the best ways to pack items of different sizes into containers. The problem is typically solved by either packing items into the first bin that has room or into the bin with the least available space where the item will still fit. >But, according to the researchers’ paper, FunSearch found a better approach by attempting to fill small gaps that were unlikely to ever be filled.