Placing N chess queens on an NxN chessboard so that no two queens threaten each other.

SQL blind data extraction POC

Implementation of Depth First Search, Breadth First Search, Iterative Deepening and A* for solving a puzzle game. This is part of a coursework assignment for Intelligent Systems module (COMP2208 - @ University of Southampton)

8 Puzzle Game

Introductive Course to Artificial Intelligence

Solving Towers of Hanoi game using uninformed search algorithms. (B.Sc. course work)

Practical implementations of Fundamental AI concepts

Solving missionary cannibal problem using different search strategies in C

Water Sort & Bloxorz Solver

Tasks for a college course titled Biologically Inspired Algorithms

Solving the N-Queens problem using a blind and informed (heuristic) search. (School Project - 2017)

A java program that solves the Eight Puzzle problem using five different search algorithms.

Introduction to Artificial Intelligence-BKU-CS

A research and implementation project about the N-Puzzle game

Search Strategies

Solve the 8 puzzle with my algorithm.

A Python toolkit that solves the Woody Block puzzle—placing varied block pieces to clear diamonds—by implementing and benchmarking both blind (BFS, DFS, IDS, UCS) and heuristic (Greedy, A\*, Weighted A\*) search strategies via an easy CLI **and a simple graphical UI**.

Test Functions (Ackley, Schwefel, Sphere etc.), Blind Search and Hill Climbing algorithms

Implementation of Blind Searches and Heuristics at Knapsack problem

Artificial Intelligence project applying blind search algorithms (BFS, DFS) to the Pacman problem, focusing on state space modeling, transition operators, and algorithmic traversal in Python (Artificial Intelligence, UNIWA).