Recent advances in artificial intelligence and computational technology have begun to reshape the landscape of mathematical research. In this talk, I will discuss how modern computational techniques such as machine learning, reinforcement learning, local search algorithms, and gradient descent can be applied to problems in extremal combinatorics. In particular, I will share my own experience using these tools, while reflecting on both the opportunities and limitations of using such methods.