A Java-based implementation of various search algorithms to solve a marble puzzle game. The program finds the optimal path to move colored marbles on a 3x3 board from an initial state to a goal state. The algorithms implemented: BFS, DFID, A*, IDA* and DFBnB

42 Algorithm project that solve n-puzzle

A high-performance Rubik’s Cube solver written in modern C++. This project features multiple cube representations (3D array, 1D array, bitboard) and implements advanced solving algorithms, including BFS, DFS, IDDFS, and IDA* with pattern database heuristics. Designed for speed, modularity, and extensibility, it’s ideal for both educational purposes

NxM-tile Puzzle solver with A*, DFID, IDA* and DFBnB algorithms

A Project demonstrating the Search Algorithms: BFS, DFS, DFID, A*(AStar), IDA*(IDAStar), DFBnB

Solving the 15-Puzzle sliding game with informed search algorithms and various heuristics.