BFS, IDS, Greedy & A* applied to the 8-puzzle problem. ⚙️

Artificial Intelligence Course at Parul University taught in Spring 2023 by Mr Smaranjit Ghose

A BFS and A* implementation to the classic 8-puzzle problem

Implementation of the 8-Puzzle problem using A* Search Algorithm

Solving RGB Puzzle via State Space Search Algorithms

a board game called Barjees ("برجيس or برسيس" in Arabic), better viewed on computers & tablets

🧠 Various Artificial Intelligence (AI) programs for solving problems, searching and pattern finding.

A* and IDA* search implemented in Java.

CSCI-4202 - Artificial Intelligence - Programming Assignment 1 – Problem Solving Using Search

⚙️ A library providing searches on state space

Another take at Sudoku solving

Lab solutions for Artificial Intelligence ("Umjetna inteligencija") course at FER 2019/20 led by izv. prof. dr. sc. Jan Šnajder and doc. dr. sc. Marko Čupić

Sokoban level solver w/ bidirectional A* search

Project of an intelligent autonomous garbage truck that implements most important learning methods in artificial intelligence. Created for Artificial Intelligence classes in the summer semester of 2020/2021 at Adam Mickiewicz University in Poznań with @HondaPL, @SmoothCrimminal and @Maciasty15.

Eight puzzle solver using iterative deepening

Logic programming

The 8-puzzle is a classic problem that involves sliding tiles in a 3x3 grid to match a desired goal configuration. The algorithm explores the shortest path from an initial configuration to the goal state and visualizes the steps involved in solving the puzzle.

A simulation of the state space search techniques using OpenGL.

Bean Merger is an interactive learning game that promotes mathematical thinking and logical reasoning through play. Players select two numbered “beans,” combine them using a mathematical operation (+, −, ×, or ÷), and create a new bean showing the result. The goal: strategically merge them until only one bean with the value 0 remains!