Constraint Satisfaction Problems and Linear Programming - Intro to Artificial Intelligence

The lecture series follows NC State's CSC 411 - Intro to AI with Dr. Adam Gaweda. This lecture introduces students to Constraint Satisfaction problems like map coloring (also known as colorability) and scheduling problems. We reference the Linear Assignment problem and reframe it as another type of scheduling problem. Finally we introduce Linear Programming, a mathematical technique commonly taught in business classes as a method for determining the optimal configuration based on constraints, such as Girl Scout cookies or Scooter Manufacturing.

Code Examples are only shared with NC State students.
Want to work on them?
Consider joining the Wolfpack at North Carolina State University ncsu.edu/about