05. CLASSICAL AI SOLVERS
Two classical AI algorithms made visible. A constraint satisfaction solver shows every variable assignment, every domain pruned by forward checking, and the moment a solution crystallises. A propositional resolution prover walks through each clause derivation until it either finds a contradiction or exhausts the search space.
Demo 01
Paste a variable file and a constraint file, pick between plain backtracking or forward checking, and watch the solver trace each branch it tries. The MRV and LCV heuristics keep the search tight; forward checking prunes dead ends before exploring them.
Demo 02
Enter a knowledge base in CNF, one clause per line, with the query on the final line. The prover negates the query, adds the negation to the KB, then applies resolution until it derives the empty clause (UNSATISFIABLE, meaning the query is entailed) or exhausts all pairs.