Solution Search Simulation The Shortest Step On Chess Horse Using Breadth-First Search Algorithm

Ade Bastian(1*), Rezha Nugraha(2),


(1) Universitas Majalengka
(2) Universitas Majalengka
(*) Corresponding Author

Abstract


Horse seed in the chess board movement resembles the letter L. The chess pieces are one of a very hard-driven beans and seeds are often also the most dangerous if not carefully considered every movement. Simulation of this problem provides a chess board size n x n. Target (goal) of this problem is to move a horse beans of a certain position on a chess board position to the desired destination with the shortest movement simulates all possible solutions to get to the goal position. This problem is also one of the classic problems in artificial intelligence (AI). Settlement of this problem can use the help system and tree production tracking.

Therefore, designed a simulation applications by utilizing several techniques of simulation programming and Breadth-First Search method. With this method, all nodes will be traced and the nodes at level n will be visited first before visiting the nodes at level n + 1. The purpose of this study is to design a software that is able to find all the solutions for the shortest movement toward the goal position by using the system of production and tracking tree.

Results from this paper is that the software is able to find all solutions shortest movement a horse beans from the initial position to the goal position and displays the simulation of the movement of the horse in the chess board.


Keywords


Chess Horse, Breadth First Search, Simulation

Full Text:

PDF

Article Metrics

Abstract view : 89 times
PDF - 15 times

References


R. Zhou and E. A. Hansen, “Breadth-first heuristic search,” Artif. Intell., 2006.

F. A. Csaszar and N. Siggelkow, “How Much to Copy? Determinants of Effective Imitation Breadth,” Organ. Sci., 2010.

S. Beamer, K. Asanović, and D. Patterson, “Direction-optimizing breadth-first search,” in Scientific Programming, 2013.

Z. Fu, H. K. Dasari, B. Bebee, M. Berzins, and B. Thompson, “Parallel breadth first search on GPU clusters,” in Proceedings - 2014 IEEE International Conference on Big Data, IEEE Big Data 2014, 2014.

K. Greff, R. K. Srivastava, J. Koutnik, B. R. Steunebrink, and J. Schmidhuber, “LSTM: A Search Space Odyssey,” IEEE Trans. Neural Networks Learn. Syst., 2017.

E. Aprile et al., “First Dark Matter Search Results from the XENON1T Experiment,” Phys. Rev. Lett., 2017.

J. L. Ferreras-Méndez, S. Newell, A. Fernández-Mesa, and J. Alegre, “Depth and breadth of external knowledge search and performance: The mediating role of absorptive capacity,” Ind. Mark. Manag., 2015.

A. K. Zobel, B. Lokshin, and J. Hagedoorn, “Formal and informal appropriation mechanisms: The role of openness and innovativeness,” Technovation, 2017.

B. P. Abbott et al., “First targeted search for gravitational-wave bursts from core-collapse supernovae in data of first-generation laser interferometer detectors,” Phys. Rev. D, 2016.

S. Terjesen and P. C. Patel, “In Search of Process Innovations: The Role of Search Depth, Search Breadth, and the Industry Environment,” J. Manage., 2017.

R. Pearce, M. Gokhale, and N. M. Amato, “Multithreaded asynchronous graph traversal for In-Memory and Semi-External Memory,” in 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2010, 2010.

I. Im, J. Jun, W. Oh, and S.-O. Jeong, “Deal-Seeking Versus Brand-Seeking: Search Behaviors and Purchase Propensities in Sponsored Search Platforms.,” MIS Q., 2016.

S. Paruchuri and S. Awate, “Organizational knowledge networks and local search: The role of intra-organizational inventor networks,” Strateg. Manag. J., 2017.

S. Sallinen, A. Gharaibeh, and M. Ripeanu, “Accelerating direction-optimized breadth first search on hybrid architectures,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015.

K. Ueno, T. Suzumura, N. Maruyama, K. Fujisawa, and S. Matsuoka, “Extreme scale breadth-first search on supercomputers,” in Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016, 2016.




DOI: https://doi.org/10.29099/ijair.v2i2.58

Copyright (c) 2018 International Journal of Artificial Intelligence Research

________________________________________________________

Organized by : Departemen Teknik Informatika STMIK Dharma Wacana
Published by : STMIK Dharma Wacana
Jl. Kenanga No.03 Mulyojati 16C Metro Barat Kota Metro Lampung
phone. +62725-7850671
Fax. +62725-7850671
Email: info@mail.ijair.id | internationaljournalair@gmail.com

statcounter International Journal of artificial intelligence research

Creative Commons License
IJAIR is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.