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
来源
4TH ANNUAL APPLIED SCIENCE AND ENGINEERING CONFERENCE, 2019 | 2019年 / 1402卷
关键词
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 条
  • [21] Girth conditioning of LDPC codes through modified breadth first search algorithm
    Bandi, Sainuele
    Tralli, Velio
    Conti, Andrea
    Nonato, Maddalena
    SOFTCOM 2007: 15TH INTERNATIONAL CONFERENCE ON SOFTWARE, TELECOMMUNICATIONS AND COMPUTER NETWORKS, 2007, : 254 - 259
  • [22] BREADTH FIRST SEARCH BASED COSINE SOFTWARE CODE FRAMEWORK AUTOMATION ALGORITHM
    Ren, Hao
    Mo, Wentao
    Zhao, Guang
    Ren, Dangpei
    Liu, Shuo
    PROCEEDINGS OF THE ASME POWER CONFERENCE, 2014, VOL 2, 2014,
  • [23] A breadth-first search based service restoration algorithm for distribution network
    Zhang, Hai-Bo
    Zhang, Xiao-Yun
    Tao, Wen-Wei
    Dianwang Jishu/Power System Technology, 2010, 34 (07): : 103 - 108
  • [24] Breadth-first heuristic search
    Zhou, R
    Hansen, EA
    ARTIFICIAL INTELLIGENCE, 2006, 170 (4-5) : 385 - 408
  • [25] Salembier's Min-tree algorithm turned into breadth first search
    Hesselink, WH
    INFORMATION PROCESSING LETTERS, 2003, 88 (05) : 225 - 229
  • [26] An Optimized Breadth-First Search Algorithm for Routing in Optical Access Networks
    Lopes, G.
    Hoffman, D.
    IEEE LATIN AMERICA TRANSACTIONS, 2019, 17 (07) : 1088 - 1095
  • [27] Improving Parallelism of Breadth First Search (BFS) Algorithm for Accelerated Performance on GPUs
    Wen, Hao
    Zhang, Wei
    2019 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC), 2019,
  • [28] Lexicographic breadth first search - A survey
    Corneil, Derek G.
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3353 : 1 - 19
  • [29] Breadth first search on massive graphs
    Ajwani, Deepak
    Dementiev, Roman
    Meyer, Ulrich
    Osipov, Vitaly
    SHORTEST PATH PROBLEM, 2009, 74 : 291 - +
  • [30] Lexicographic breadth first search - A survey
    Corneil, DG
    GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2004, 3353 : 1 - 19