local-beam-search

A highly modular Object-Oriented AI framework and interactive lab implemented in Python. Features automated benchmarking, pluggable solver engines, and interactive Pygame visualizers for Search, CSPs, Optimization, and Adversarial Games.

Visualize the classic N-Queens puzzle 👑 in real time using AI search algorithms — Hill Climbing, Simulated Annealing, and Local Beam Search. Built with Python, Pygame, and NumPy, it beautifully animates how AI solves complex constraint problems step by step.

Traditional AI algorithms and search strategies: Multi-robot pathfinding with dynamic obstacles, constraint satisfaction problems, and optimization techniques. Implementations include A*, CSP solvers, genetic algorithms, and local beam search for real-world AI applications.