AI - Project 1 - 8-puzzle solver using bidirectional search
-
Updated
Jun 24, 2024 - Python
AI - Project 1 - 8-puzzle solver using bidirectional search
A simple 8-puzzle game made with VueJS
Using breadth-first-search, depth-first-search, A* algorithm to solve 8-puzzle-problem and missionaries-cannibals-problem
A C-based 8 puzzle solver using graphs and Abstract Data Types and 3 search-algorithms: DFS, BFS, Best-First with Manhattan Distance
电子科技大学 2020 级《人工智能》课程代码。
8-puzzle game is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing
Puzzle8 solver - school project
8-Puzzle Solver webapp it uses different search algorithms to solve the classic 8-puzzle problem.
Solving 8-puzzle with BFS and DFS algorithms
Solving 8-puzzle with BFS and DFS algorithms
🧩 Solver for N-Puzzle & N-Queens using Genetic Algorithms, A*, and more in Python
The main assignments for the Artificial Intelligence course offered at the University of Tehran.
The notebook contains the description and implementation of 2 search algorithms:
A* search algorithm implementation for solving 8-puzzle problem. Includes code modularization, performance optimization and solvability checking features.
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."