Lecture
Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.
This lecture covers the optimization methods used in the implementation of a SAT solver, including recursive vs iterative approaches, decision heuristics, implication graphs, and benchmarks. It also explores the application of these techniques in solving Sudoku puzzles.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace