Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

Game of Bloxorz Solving Agent Using Informed and Uninformed Search Strategies

Published: 01 January 2019 Publication History

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.

References

[1]
G. Weiss, Multiagent systems: a modern approach to distributed artificial intelligence, 3rd ed., MIT Press, USA, 2006, pp. 29–47.
[2]
Z. Abd Algfoor, M.S. Sunar, H. Kolivand, A Comprehensive Study on Pathfinding Techniques for Robotics and Video Games, International Journal of Computer Games Technology 2015 (2015) 11.
[3]
H.S. Nwana, D.T. Ndumu, A Brief Introduction to Software Agent Technology, in: N.R. Jennings, M.J. Wooldridge (Eds.), Agent Technology: Foundations, Applications, and Markets, Springer Berlin Heidelberg, Berlin, Heidelberg, 1998, pp. 29–47.
[4]
H. Shi, "Searching Algorithms Implementation and Comparison of Eight-puzzle Problem," presented at the International Conference on Computer Science and Network Technology (ICCSNT), 2011.
[5]
N. Krishnaswamy, Comparison of Efficiency in Pathfinding Algorithms in Game Development, in: The College of Computing and Digital Media, DePaul University, 2009.
[6]
N. I. G. Nwulu E.A., "Single Agent Shortest Path Determination in The Game of Bloxorz," African Journal of Natural Sciencespp. 9-14, 2014.
[7]
B. Kamies, "Solving Logic Puzzles using Model Checking in LTSmin," presented at the 24th Twente Student Conference on IT, Enschede, The Netherlands, 2016.
[8]
S.J.R. Peter Norvig, ARTIFICIAL INTELLIGENCE: a modern approach, PEARSON, 2018.
[9]
V. Kumar, J. K. Chhabra, and D. Kumar, "Performance Evaluation of Distance Metrics in the Clustering Algorithms," INFOCOMP no. 1, pp. 38-52%V 13, 2014-09-01 2014.
Index terms have been assigned to the content through auto-classification.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Procedia Computer Science
Procedia Computer Science  Volume 163, Issue C
2019
651 pages
ISSN:1877-0509
EISSN:1877-0509
Issue’s Table of Contents

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 January 2019

Author Tags

  1. A*
  2. agent
  3. Bloxorz
  4. breadth-first search
  5. depth-first search
  6. heuristic function
  7. path-finding problem
  8. puzzle

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media