Welcome to the AI Game Agents Collection repository! This project brings together AI implementations for various classic games, including Tic-Tac-Toe, Sliding Puzzles, and logic-based challenges. Each AI is designed to play optimally using algorithms such as Minimax, heuristics, and search-based techniques.
- 5x5 Tic-Tac-Toe AI – A larger board variation with enhanced AI strategies.
- 3x3 Tic-Tac-Toe with Minimax – Classic Tic-Tac-Toe solved using the Minimax algorithm.
- 8-Piece Sliding Puzzle Solver – AI solver for the classic sliding puzzle game.
- Corn, Goose, and Fox Problem – AI solution to the famous river-crossing puzzle.
Each game agent is housed in its respective repository. Click on the links above to explore their implementations, AI strategies, and how to run them.
Feel free to contribute by improving existing agents or adding new AI-based games! Fork the repo, make changes, and submit a pull request.
This project is licensed under the MIT License.