Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it Explore a fascinating seminar lecture that delves into the application of SAT solvers for solving geometric cutting problems. Learn how to transform the challenge of dividing figures into equal parts along grid lines into a combinatorial problem solvable through SAT reduction. Discover the comparative effectiveness of this approach against traditional brute force search methods through practical demonstrations and examples. Features an engaging discussion with Konstantin Shamsutdinov about specific cutting problems, including a notable case of dividing a 7x7 grid into 7 parts and assembling a 7x7x7 cube. Part of the historic Kolmogorov seminar series on computational and descriptional complexity, originally established by Kolmogorov in 1979.