P vs NP: Machine Learning Solves Hard Problems Easily #shorts

The easiest example is sudoku very hard to generate solution right there tons of solutions but it's very easy to prove it's if it's correct right or go or chess it's very easy to verify the solution and the theory is here which is by the way if you're in computer science you remember the p equals np problem if not I want to talk about that right now but this thesis is everything where it's easy to verify solution but hard to generate machine learning is going to solve