🧩 Solver for N-Puzzle & N-Queens using Genetic Algorithms, A*, and more in Python
-
Updated
Dec 1, 2023 - Python
🧩 Solver for N-Puzzle & N-Queens using Genetic Algorithms, A*, and more in Python
Connect4 game implementation and AI with MiniMax, Alpha-Beta Pruning, Iterative Deepening
simple solver for a pocket cube
This project implemented the AI with Minimax Algorithm, Alpha-Beta Pruning and Iterative Deepening algorithms to play Sudo Isolation Game.
Kalaha game written in Python, PyQt and C++
This is a Python project that uses Tkinter to develop the front end of the application and Python to implement AI searches. This has a cool graphical interface and visualization to make the project look aesthetic.
Game-Playing Agent
an adversarial search agent to play the game "Isolation"
8 Puzzle Solver Using Iterative Deepening Algorithm
FreeCell AI implementing BFS/DFS/A*/Iterative Deepening in Python
Solving by iterative deepening and hill climbing with random restart
Sokobond game developed for the Curricular Unit of Artificial Intelligence. Developed Artificial Intelligence Algorithms to solve 10 different levels, all with different complexities and new game mechanics
These are my solutions to homeworks and projects of Artificial Intelligence course.
Simple AlphaZero Reinforcement Learning implementation for Go.
In this project many tree search techniques are implemented applied to different problems.
A game-playing AI agent is developed for a Competitive Sudoku game using minimax algorithm with alpha-beta pruning and iterative deepening. It is further advanced using heuristics and Monte Carlo Tree Search algorithm.
Gameplay, minmax, alpha beta pruning
HCMUS - Artificial Intelligence - Lab01: Search Strategies
Add a description, image, and links to the iterative-deepening-search topic page so that developers can more easily learn about it.
To associate your repository with the iterative-deepening-search topic, visit your repo's landing page and select "manage topics."