ida-star

NxM puzzle solver using graph traversal algorithms

Sliding Puzzle solver and utilities

🧩 PuzzleMaestro — Puzzle deslizante 4x4 en Java Swing con solucionador automático IDA* (Manhattan + conflicto lineal), animación paso a paso y 101 pruebas JUnit 5.

The N-puzzle is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing. The puzzle can be of any size, with the most common sizes being 3x3 and 4x4. The objective of the puzzle is to rearrange the tiles to form a specific pattern.

Pathfinding Visualizer developed using Unity 6.1 - DFS, BFS, UCS, A*, IDA*, IDDFS, Greedy Best-first Search and Bidirectional Search

Applying state of the art AI search algorithms to solve the Sokoban game automatically. Since Sokoban game itself is quite challenging due to its problem complexity, additionally, heuristic functions and deadlock detectors are applied. (Python)

Implementation of different graph search algorithms in Python

A Rubik's Cube solver using BFS, DFS, IDDFS, and Korf's IDA* algorithms in C++

Optimal Rubik's cube solver in C++ - guaranteed minimum-move solutions via IDA* with pattern databases, 12-move scrambles under 30ms

Implementation of uninformed and informed AI search algorithms in Rust. Search algorithms include BFS, DFS, A*, RBFS, IDS, IDA*, and GBFS.

Implementation and performance analysis of the IDA* (Iterative Deepening A*) pathfinding algorithm with comparisons against A*.

A 15-puzzle solver that works infallibly.

Sliding game Puzzle 15, with bot for auto solving, that uses the IDA* algorithm

n-puzzle solver

This application finds the shortest path between the entrance and the exit of a maze, while avoiding obstacles. It does so using the IDA* path search algorithm. Extensive use is also being made of the C+ coding style.

This is a homework about various Uninformed and Informed search algorithms, implemented for solving a simple game. This homework is a part of many projects in a Fundamentals to AI course @ FUM.

Java graph traversal and path finding algorithms library. Implements Iterative deepening A* (IDA*)

Implementation of UCS and IDA* algorithms, using them to calculate paths in a city based on traffic predictions.

The goal of this project is to programmatically solve the N-puzzle