A collection of classic AI search algorithms and game implementations, showcasing fundamental concepts in pathfinding and game theory.
AI-Search-Algorithms/
│
├── A star Algorithm/
│ ├── Code Files/
│ └── Flow Charts/
│
├── Battle Grid Game/
│ └── battle_grid_game.txt
│
├── Checker game/
│ ├── Code Files/
│ └── Video/
│
└── README.md
An implementation of the A* algorithm, a cornerstone of pathfinding and graph traversal.
- Source Code: Find the implementation in
A star Algorithm/Code Files/ - Flow Charts: Understand the logic with diagrams in
A star Algorithm/Flow Charts/
Key Features:
- 🏎 Efficient Pathfinding — Finds the shortest path between two points while avoiding obstacles.
- 🧠 Heuristic Function — Uses an admissible heuristic (h(n)) to optimize the search process.
- 🗺 Grid-Based — Designed for grid worlds, perfect for games and simulations.
A fully playable implementation of the classic board game Checkers.
- Source Code: The game logic is located in
Checker game/Code Files/ - Video Demo: Watch the game in action in the
Checker game/Video/folder.
Key Features:
- 🎯 Playable Game — Complete two-player Checkers experience.
- 🤖 AI Opponent — Features an AI opponent, likely using a search algorithm like Minimax to decide the best move.
- 🖱 Interactive Gameplay — User-friendly and interactive.
A text-based or simple graphical tactical battle game played on a grid.
- Source Code: Located in the root
Code Files/directory. - Game Data: The game's map or initial setup can be found in
Battle Grid Game/battle_grid_game.txt.
Key Features:
- ♟ Turn-Based Strategy — Engage in tactical, turn-based combat.
- 🗺 Grid Environment — All action takes place on a structured grid, requiring strategic positioning.
- ⚙️ Customizable Scenarios — Modify the
.txtfile to create new battle scenarios.
- Language: Python / C++ / Java (replace with actual language used)
- Core Algorithms: A* Search, Minimax / Game Tree Search
- Key Concepts: Heuristics, Pathfinding, Game Theory, State-Space Search
- Data Structures: Graphs, Grids, Trees
git clone https://github.com/rabbia67/AI-Search-Algorithms.git- Navigate to the project folder you want to run (e.g.,
A star Algorithm/). - Open the
Code Files/sub-directory. - Follow the instructions in the source code files to compile and run the project.
| Project | Main Feature | Potential Application |
|---|---|---|
| A* Algorithm | Optimal and complete pathfinding | Robotics, video game character navigation |
| Checker Game | AI opponent using adversarial search | Learning game theory, AI in turn-based games |
| Battle Grid Game | Simple turn-based tactical simulation | Prototyping strategy games, AI behavior |
This project is for educational and demonstrative purposes. Please provide attribution if you use the code in your work.