Comparative analysis of AI-based search algorithms in solving 8 puzzle problems
Abstract Background The 8-puzzle problem is a well-known combinatorial search problem, often used to test the effectiveness of various artificial intelligence (AI) algorithms. This study aims to evaluate the performance of three AI-based search algorithms—Breadth-First Search (BFS), Depth-First Sear...
Saved in:
| Main Authors: | Ghaniyyat Bolanle Balogun, Daniel Ibisagba, Amos Bajeh, Taofik Olawale Debo, Abdulraheem Muyideen, Olumuyiwa James Peter |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2024-11-01
|
| Series: | Bulletin of the National Research Centre |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s42269-024-01274-3 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Applying the Intelligence of Ant and Tabu Search to Solve The 8-puzzle Problem
by: Ruqaya Sha’ban
Published: (2013-07-01) -
Solving the traffic signaling problem using the iterated local search metaheuristic
by: Elvir Misini, et al.
Published: (2025-07-01) -
Harmony Search Algorithm with Two Problem-Specific Operators for Solving Nonogram Puzzle
by: Geonhee Lee, et al.
Published: (2025-04-01) -
Solving the shortest path Problem in an interval-valued Neutrosophic Pythagorean environment using an enhanced A* search algorithm
by: Prasanta Kumar Raut, et al.
Published: (2025-02-01) -
New Heuristic Local Search Method for University Course Timetabling
by: Mohammad Sadegh Shiri, et al.
Published: (2023-02-01)