Puzzle game solving with breadth first search algorithm

被引:1
|
作者
Rahim, R. [1 ]
Dijaya, R. [2 ]
Multazam, M. T. [2 ]
Daengs, A. G. S. [3 ]
Sudrajat, D. [4 ]
机构
[1] Univ Malaysia Perlis, Sch Comp & Commun Engn, Kangar, Perlis, Malaysia
[2] Univ Muhammadiyah Sidoarjo, Sidoarjo, Indonesia
[3] Univ 45 Surabaya, Surabaya, Indonesia
[4] STMIK IKMI Cirebon, Cirebon, Indonesia
关键词
D O I
10.1088/1742-6596/1402/6/066040
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Today's games have been played by many people from young to old age. There are many types of games, one of which is a puzzle game. Puzzles, which are brain teasers that challenge the skills of their players, never seem to lose their popularity and are never consumed by age. Puzzle is one type of game that is enough to squeeze the brain to solve it. The solution that can be used to simplify problem solving is to apply a search algorithm that is used to check the initial state to the final state and provide the most optimal solution for completing the puzzle, the purpose of this study were using algorithm used to solve these problems using the Breadth First Search algorithm. The use of the Breadth First Search algorithm in solving puzzle games can make it easier for users to get the best solution in the form of completion steps and also the possibility of solving various conditions based on the puzzle conditions that you want to solve.
引用
收藏
页数:4
相关论文
共 50 条
  • [1] Congklak, a traditional game solution approach with breadth first search
    Rahim, Robbi
    Kurniasih, Nuning
    Hasibuan, Abdurrozzaq
    Andriany, Liesna
    Najmurrokhman, Asep
    Supriyanto, S.
    Wardayani, W.
    Hidayat, Rahmat
    Lubis, D. S. W.
    Napitupulu, Darmawan
    Nugraha, Anggara Trisna
    Siburian, Henry Kristian
    Abdullah, Dahlan
    3RD ANNUAL APPLIED SCIENCE AND ENGINEERING CONFERENCE (AASEC 2018), 2018, 197
  • [2] The Communication Analysis of Implementation in Breadth First Search Algorithm
    Sun, YiChun
    Yi, XiaoDong
    Liu, HengZhu
    2016 IEEE INTERNATIONAL CONFERENCE ON INTERNET OF THINGS (ITHINGS) AND IEEE GREEN COMPUTING AND COMMUNICATIONS (GREENCOM) AND IEEE CYBER, PHYSICAL AND SOCIAL COMPUTING (CPSCOM) AND IEEE SMART DATA (SMARTDATA), 2016, : 754 - 759
  • [3] Efficient distributed breadth-first search algorithm
    Makki, SAM
    COMPUTER COMMUNICATIONS, 1996, 19 (08) : 628 - 636
  • [4] A parallel algorithm for the stack breadth-first search
    Nakashima, T
    Fujiwara, A
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2002, E85D (12) : 1955 - 1958
  • [5] Efficient Implementation of Breadth First Search for General Video Game Playing
    Ito, Suguru
    Guo, Zikun
    Chu, Chun Yin
    Harada, Tomohiro
    Thawonmas, Ruck
    2016 IEEE 5TH GLOBAL CONFERENCE ON CONSUMER ELECTRONICS, 2016,
  • [6] A Novel Algorithm for Detecting Protein Complexes with the Breadth First Search
    Tang, Xiwei
    Wang, Jianxin
    Li, Min
    He, Yiming
    Pan, Yi
    BIOMED RESEARCH INTERNATIONAL, 2014, 2014
  • [7] An adaptive breadth-first search algorithm on integrated architectures
    Zhang, Feng
    Lin, Heng
    Zhai, Jidong
    Cheng, Jie
    Xiang, Dingyi
    Li, Jizhong
    Chai, Yunpeng
    Du, Xiaoyong
    JOURNAL OF SUPERCOMPUTING, 2018, 74 (11): : 6135 - 6155
  • [8] An adaptive breadth-first search algorithm on integrated architectures
    Feng Zhang
    Heng Lin
    Jidong Zhai
    Jie Cheng
    Dingyi Xiang
    Jizhong Li
    Yunpeng Chai
    Xiaoyong Du
    The Journal of Supercomputing, 2018, 74 : 6135 - 6155
  • [9] Temporal resolution using a breadth-first search algorithm
    Dixon, C
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1998, 22 (1-2) : 87 - 115
  • [10] The Breadth First Search Traversing Algorithm of the Graphs in DNA Computer
    Yang, Chunde
    Wei, Guohui
    Tan, Jun
    Xie, Jingbo
    2009 3RD INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICAL ENGINEERING, VOLS 1-11, 2009, : 3323 - 3326