Tahani Q. Alhassan, Shefaa S. Omar, Lamiaa A. Elrefaei, Game of Bloxorz Solving Agent Using Informed and Uninformed Search Strategies, Procedia Computer Science, Volume 163, 2019, Pages 391-399, ISSN 1877-0509, https://doi.org/10.1016/j.procs.2019.12.121.
• 2020
Publication Information
Authors
Not Available
Keywords
Not Available
Journal
Not Available
Publisher
Not Available
Volume
Not Available
Issue
Not Available
Pages
Not Available
publication.type
International
Paper Link
Open Link
Supplementary Materials
Not Available
Abstract
Bloxorz is a block sliding puzzle game that can be categorized as a pathfinding problem. Pathfinding problems are well known problems in Artificial Intelligence field. In this paper, we proposed a single agent implementation to solve level-1 of Bloxorz game using Informed and Uninformed searching algorithms: Breadth-First Search (BFS), Depth-First Search (DFS), and A-star (A*) searching algorithms. The agent solves the problem using the three algorithms to compare their performance and conduct a conclusion that may help in improving the use of searching algorithms in this area. In this paper, A* and breadth-first search algorithms are founded to be more convenient to solve this problem.
Staff Members - Benha University