A collection of Python implementations of fundamental Artificial Intelligence algorithms, demonstrating proficiency in Search Methods, Game Theory, and Reinforcement Learning.
1. 8-Puzzle AI Solver 🧩
An agent that solves the classic 8-puzzle sliding tile game.
- Key Algorithms: Breadth-First Search (BFS), A* (A-Star).
- Highlights: Comparison of heuristic efficiency (Manhattan distance / Displacement).
A smart adversary bot for the strategy board game Reversi.
- Key Algorithms: Minimax Algorithm, Alpha-Beta Pruning (implied), Heuristic Evaluation functions.
- Highlights: Greedy strategies vs. Lookahead strategies.
A Reinforcement Learning solver for stochastic grid environments.
- Key Algorithms: Value Iteration, Policy Iteration (Dynamic Programming).
- Highlights: Solving Markov Decision Processes (MDP) with Bellman updates and convergence visualization.
- Language: Python 3.x
- Libraries: NumPy, Matplotlib (for visualizations)
- Concepts: OOP, Algorithm Complexity, Heuristics, Optimization.
Created by Ohad Shmuel.