CSE 318 Artificial Intelligence Sessional (L3/T2)
Program utilizing an A* algorithm with various heuristics to solve nxn sliding puzzles. Outputting the steps required to solve the puzzle into txt files.
AI Lab Offlines and Onlines
A Java implementation of Graph Search with heuristics for N-Puzzle problem
Implementation of A* Search, Constraint Satisfaction Problem, Local Search and Knowledge Engineering
A solver for N-Puzzles that implements search algorithms to find the optimal solution.
This Repository contains a solver for fifteen-puzzle To be specific, the NxN sliding puzzle solver in JAVA. The program uses a specific version of Kruskal Algorithm mainly known by A* algorithm with three different heuristics. It uses greedy version of the A* algorithm along side of different heuristics in order to achieve faster solutions
Implementação em java para o desafio 8-Puzzle.
Contains all the assignments of the course CSE-318 offered in CSE, BUET
Add a description, image, and links to the n-puzzle topic page so that developers can more easily learn about it.
To associate your repository with the n-puzzle topic, visit your repo's landing page and select "manage topics."