A strong chess engine made in c++
-
Updated
Sep 2, 2024 - C++
A strong chess engine made in c++
Solve the Fifteen Puzzle optimally with IDA* using different heuristics.
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.
A sliding puzzle game and solver using ncurses.
A UCI-compatible Chess Engine written in C++20 with an Android and WearOS Interface
A UCI-compatible chess engine, capable of beating (most) human players.
A MinMax based Othello/Reversi AI for 8x8 & 10x10
Chess engine based on min-max algorithm, iterative deepening and transposition tables
A chess playing program written in C++, This will include some AI search algorithms and Game theory algorithms as it progresses.
Creating an "AI" using minimax algorithm to never lose at Connect4
First project developed for Artificial Intelligence class
♟️ Ataxx [2 Player Console Game]
Graduate level Artificial Intelligence coursework
An AI playing Gomoku 15x15 using Negamax algorithm, NegaScout algorithm, Zobrist Hashing, Null Window written in C++
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
Implementation of different graph algorithm using 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."