Solve the Fifteen Puzzle optimally with IDA* using different heuristics.
-
Updated
Oct 9, 2023 - C++
Solve the Fifteen Puzzle optimally with IDA* using different heuristics.
A MinMax based Othello/Reversi AI for 8x8 & 10x10
A strong chess engine made in c++
This is an Artificial Intelligence project which solves the 8-Puzzle problem using different Artificial Intelligence algorithms techniques like Uninformed-BFS, Uninformed-Iterative Deepening, Informed-Greedy Best First, Informed-A* and Beyond Classical search-Steepest hill climbing.
Solving a brick puzzle with different search algorithms
A UCI-compatible Chess Engine written in C++20 with an Android and WearOS Interface
A sliding puzzle game and solver using ncurses.
Graduate level Artificial Intelligence coursework
Creating an "AI" using minimax algorithm to never lose at Connect4
An AI playing Gomoku 15x15 using Negamax algorithm, NegaScout algorithm, Zobrist Hashing, Null Window written in C++
A chess playing program written in C++, This will include some AI search algorithms and Game theory algorithms as it progresses.
Course work for SSU's CS480 which is a survey of techniques that simulate human intelligence.
Implementation of MinMax Algorithm.
Artificial Intelligence I course mid-quarter project - autumn 2020
First project developed for Artificial Intelligence class
Implementation of different graph algorithm using C++.
Chess engine based on min-max algorithm, iterative deepening and transposition tables
Algorithms Coded in C++ Language.
Solving Game of 8 puzzle using differint AI search algorithms BFS, IDS, and A*. The purpose of this project is compare the time and space complexity for different search algorithms.
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."