Python script for solving the classic "8-puzzle" game

8-Puzzle solver

A program that solves the 8-puzzle problem using the A* algorithm

A small program that simulates the solving of the 8 puzzle game using Breadth First Search, Depth First Search and the A* algorithm

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

A simple 8 Puzzle Solver in Java capable of solving all combinations of legal 8 Puzzle games using a variety of algorithms as well as starting positions of the player’s choosing.

Basic 8-puzzle solver using A* search

This application allows you to view a representation of a range of different graph search algorithms, whilst solving your choice of 8-puzzle problems.

Solutions to the classic 8 puzzle, implementing an A* best search algorithm to complete the puzzle in multiple languages.

AI Lab Offlines and Onlines

Project 1 for ITCS 6150: Intelligent Systems.

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

8 puzzle problem simulation.

A* and IDA* algorithms on 8-Puzzle

Also known as 8-puzzle or 15-puzzle using A* algorithm

This is the artificial intelligence problem solving project. This work has been done during the course of Artificial Intelligence in my bachelors degree. There are three problems in this project; United Federation of Planets (UFP), Raju’s Patterns and 8-Puzzle which have been solved through AI algorithms.

This is an Artificial Intelligence project which solves the 8-Puzzle problem using different Artificial Intelligence algorithms techniques like Uninformed-BFS, Uninformed-Iterative Deepening, Informed-Greedy Best First, Informed-A* and Beyond Classical search-Steepest hill climbing.