This repository contains implementations of common Artificial Intelligence search algorithms using Python.
The project is designed for learning, practice, and academic purposes.
- Implementation of classic AI search algorithms
- Easy-to-understand Python code
- Beginner-friendly project structure
- Suitable for AI and algorithm learning
- Python 3
- Git & GitHub
- VS Code
ai-search-algorithm-implementations/
│
├── README.md
├──documents.ipynb
├── graph.py
├── algorithms/
│ ├── bfs.ipynb
│ ├── dfs.ipynb
│ ├── astar.ipynb
│ └── greaddy.ipynb
└── examples/- Breadth First Search (BFS)
- Depth First Search (DFS)
- Uniform Cost Search (UCS)
- A* Search Algorithm
- Greedy Best First Search
- Other AI search techniques
git clone https://github.com/YOUR_USERNAME/ai-search-algorithm-implementations.gitcd ai-search-algorithm-implementationspip install -r requirements.txtRun the main Python file:
python main.pyOr run a specific algorithm file:
python bfs.pyThis project helps students understand:
- Problem-solving techniques in AI
- Graph traversal algorithms
- Pathfinding methods
- Search optimization strategies
- Python programming practices
- Visual Studio Code
- PyCharm
Contributions are welcome.
- Fork the repository
- Create a new branch
- Make improvements
- Submit a pull request
This project is for educational purposes.
Developed by Kura Lemma
GitHub: https://github.com/kura458