A sliding puzzle game and solver using ncurses.
-
Updated
Mar 5, 2017 - C++
A sliding puzzle game and solver using ncurses.
Graduate level Artificial Intelligence coursework
Problem solving using iterative deepening depth first search.
Implementation of MinMax Algorithm.
A MinMax based Othello/Reversi AI for 8x8 & 10x10
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.
First project developed for Artificial Intelligence class
Solving a brick puzzle with different search algorithms
Chess engine based on min-max algorithm, iterative deepening and transposition tables
A UCI-compatible chess engine, capable of beating (most) human players.
Algorithms Coded in C++ Language.
Artificial Intelligence I course mid-quarter project - autumn 2020
Solving the Rubik's Cube using three different search strategies including Iterative Deepening Search, A Star Search, Iterative Deepening A Star Search. The searches were compared in terms of: Number of nodes expanded and Optimality.
♟️ Ataxx [2 Player Console Game]
Implementation of different graph algorithm using C++.
A chess playing program written in C++, This will include some AI search algorithms and Game theory algorithms as it progresses.
A UCI-compatible Chess Engine written in C++20 with an Android and WearOS Interface
An AI playing Gomoku 15x15 using Negamax algorithm, NegaScout algorithm, Zobrist Hashing, Null Window written in C++
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."