Constraint Programming with BEAM - Solving Queens, Reindeers, and Sudoku Problems

Explore a conference talk from ElixirConf EU 2024 that delves into constraint programming implementation on the BEAM virtual machine. Learn about Fixpoint, a project that brings constraint programming capabilities to Elixir, following the "maximally concurrent" model proposed by Peter Van Roy and Seif Haridi. Discover how this implementation compares to established constraint programming solvers like Google's OR-Tools, IBM's CPLEX, and Gecode, which are widely used in industry for planning, scheduling, and business process optimization. Through LiveBook demonstrations, examine practical applications including solving classic problems like Queens, Reindeers, and Sudoku. Gain insights into how the BEAM architecture's concurrent nature makes it particularly well-suited for implementing constraint programming solutions.