NegaSnake: winner of AI Snakes 2021
-
Updated
Feb 1, 2022 - Java
NegaSnake: winner of AI Snakes 2021
A simple command-line Java program for solving the n-puzzle using various search strategies.
Implementation of various Artificial Intelligence problems in java
A Go game playing AI Agent using MiniMax with Alpha Beta Pruning and Iterative Deepening algorithms
A fun side project to perform AI algorithms using plain java code.
CITS3001 AI project
A javafx application to play Lines of Action board game against an AI agent. The AI agent uses iterative deepening search on minimax algorithm with alpha-beta pruning while making decisions.
A*, Breadth First, Depth First, and Iterative Deepening Search
Board game player that uses alpha beta algorithm with iterative deepening in order to defeat their opponent.
This program solves 2D maze using various uninformed and informed (heuristic) search strategies.
Implementation of the Best Vertex Cover Search problem using Hill Climbing and Iterative Deepening.
Saving Westros with searching algorithms.
An artificial intelligence software designed to simulate the character Neo from the matrix movie escaping the matrix under different circumstances
Group project on Tree Search Algorithms for the Curricular Unit of "Artificial Intelligence" @ FCUP, Porto with @barbara-san and @Nia3324
Solving RGB Puzzle via State Space Search Algorithms
Project for the University of Bologna Algorithms and Data Structures course (a.y. 2020-21).
To implement iterative deepening graph search
classical search algorithms are used in AI | AI course - Fall 2018
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."