This is a simple 8-puzzle game solved using different search algorithms (A Star, BFS).
-
Updated
Nov 23, 2022 - Python
This is a simple 8-puzzle game solved using different search algorithms (A Star, BFS).
Python modules for solving AI problems
This program tests different search algorithms to solve the 8 puzzle.
电子科技大学 2020 级《人工智能》课程代码。
Artificial Intelligence. A* Algorithm. Minimax Algorithm and Alpha-Beta pruning
Using heuristic search (Hill Climb with BFS and DFS) methods to solve 8-puzzle
Repository for the 8-puzzle problem solving project for the Artificial Intelligence discipline of the Computer Science course at the University of Lavras
Numeric 8 Puzzle in pygame
8-Puzzle solver in python using A* and manhatten heuristics
Simple BFS search to solve N-Puzzle Problem
8 puzzle and 15 puzzle game using Backtracking algorithm
The 8-puzzle problem is a puzzle invented and popularized by Noyes Palmer Chapman in the 1870s. It is played on a 3-by-3 grid with 8 square blocks labeled 1 through 8 and a blank square. Your goal is to rearrange the blocks so that they are in order.
A* and IDA* algorithms on 8-Puzzle
Add a description, image, and links to the 8-puzzle topic page so that developers can more easily learn about it.
To associate your repository with the 8-puzzle topic, visit your repo's landing page and select "manage topics."