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 条

[31] Solving the puzzle problem using Hopfield neural network in conjunction with tree search algorithm
Taheri, J
PROCEEDINGS OF THE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS 2003, VOLS 1-4, 2003, : 456 - 461
[32] Reformulating a Breadth-First Search Algorithm on an Undirected Graph in the Language of Linear Algebra
Buecker, H. Martin
Sohr, Christian
2014 INTERNATIONAL CONFERENCE ON MATHEMATICS AND COMPUTERS IN SCIENCES AND IN INDUSTRY (MCSI 2014), 2014, : 33 - 35
[33] A successive interference cancellation algorithm in MIMO systems via breadth-first search
Su, Yongtao
Zhang, Xian-Da
Wang, Xiaodong
2008 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING, VOLS 1-12, 2008, : 2709 - +
[34] A fewest-turn-and-shortest path algorithm based on breadth-first search
Zhou, Yan
Wang, Weisheng
He, Di
Wang, Zhe
GEO-SPATIAL INFORMATION SCIENCE, 2014, 17 (04) : 201 - 207
[35] Learning Analytics for a Puzzle Game to Discover the Puzzle-Solving Tactics of Players
Vahdat, Mehrnoosh
Carvalho, Maira B.
Funk, Mathias
Rauterberg, Matthias
Hu, Jun
Anguita, Davide
ADAPTIVE AND ADAPTABLE LEARNING, EC-TEL 2016, 2016, 9891 : 673 - 677
[36] Parallel Breadth First Search on GPU Clusters
Fu, Zhisong
Dasari, Harish Kumar
Bebee, Bradley
Berzins, Martin
Thompson, Bryan
2014 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2014, : 110 - 118
[37] Algorithm for Solving the Problem of the First Phase in a Game Problem with Arbitrary Situations
Mamatov, Akmal R.
BULLETIN OF IRKUTSK STATE UNIVERSITY-SERIES MATHEMATICS, 2024, 48 : 3 - 20
[38] JDART: Portfolio Solving, Breadth-First Search and SMT-Lib Strings (Competition Contribution)
Mues, Malte
Howar, Falk
TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT II, TACAS 2021, 2021, 12652 : 448 - 452
[39] Design and implementation of a web structure mining algorithm using breadth first search strategy for academic search application
Department of Computer Science, BITS Pilani, Dubai Campus, Dubai, United Arab Emirates
Int. Conf. Internet Technol. Secured Trans., ICITST, 2011, (648-654):
[40] A compressed breadth-first search for satisfiability
Motter, DRB
Markov, IL
ALGORITHM ENGINEERING AND EXPERIMENTS, 2002, 2409 : 29 - 42

← 1 2 3 4 5 →