This repository showcases a collection of AI projects implemented in Python. It demonstrates a wide range of skills and knowledge in traditional artificial intelligence, problem modeling, and algorithmic solutions.
- Implementation of a depth-limited Minimax algorithm with Alpha-Beta pruning and Iterative Deepening. Extensions include Zobrist hashing, moves ordering, and advanced evaluation.
- Analyzing and implementing SAT solving algorithms (GSAT, walkSAT, DPLL) for solving Sudoku puzzles.
- Pathfinding in ASCII mazes using A* and Uniform-Cost-Search algorithms, including multi-robot coordination and a blind robot variant.
- A solver for Constraint Satisfaction Problems (CSPs) using heuristics and inference techniques like MRV, LCV, and AC-3.
- Algorithms to solve the “missionaries and cannibals” problem variant with a focus on safe river crossing for chickens and foxes.
- Estimating a robot's position in a maze using a Hidden Markov Model (HMM), with probabilistic filtering and sensory input analysis.
- Implementing a Probabilistic Roadmap (PRM) for motion planning in planar robot arms in environments with obstacles.