Steepest Ascent Hill Climbing Algorithm To Solve Cases In Puzzle Game 8

S. Silvilestari
{"title":"Steepest Ascent Hill Climbing Algorithm To Solve Cases In Puzzle Game 8","authors":"S. Silvilestari","doi":"10.30645/ijistech.v5i4.153","DOIUrl":null,"url":null,"abstract":"The 8th puzzle compiling game is part of searching. Puzzle 8 is an implementation of the steepest ascent hill climbing algorithm by following the established rules. The working process of this algorithm is by looking at the initial position of the puzzle arrangement, after carrying out the process, the results of the shift are seen, whether it is approaching the correct arrangement position. The problem that often occurs is the lack of knowledge in solving game cases quickly so that it takes a long time to obtain the final state. The main purpose of this study is to provide information so that it is easy to solve puzzle game cases using an algorithm. The final result is a puzzle arrangement that is in accordance with the rules by using the concept of an algorithm so as to obtain a decision-making system to complete the puzzle game correctly.","PeriodicalId":355398,"journal":{"name":"IJISTECH (International Journal of Information System and Technology)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IJISTECH (International Journal of Information System and Technology)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30645/ijistech.v5i4.153","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The 8th puzzle compiling game is part of searching. Puzzle 8 is an implementation of the steepest ascent hill climbing algorithm by following the established rules. The working process of this algorithm is by looking at the initial position of the puzzle arrangement, after carrying out the process, the results of the shift are seen, whether it is approaching the correct arrangement position. The problem that often occurs is the lack of knowledge in solving game cases quickly so that it takes a long time to obtain the final state. The main purpose of this study is to provide information so that it is easy to solve puzzle game cases using an algorithm. The final result is a puzzle arrangement that is in accordance with the rules by using the concept of an algorithm so as to obtain a decision-making system to complete the puzzle game correctly.
解谜游戏8中最陡爬坡算法
第8个解谜游戏是搜索的一部分。《Puzzle 8》是遵循既定规则的最陡爬坡算法的执行。本算法的工作过程是通过观察拼图排列的初始位置,在执行过程后,看到移位的结果,是否正在接近正确的排列位置。经常出现的问题是缺乏快速解决游戏案例的知识,以至于需要很长时间才能获得最终状态。本研究的主要目的是提供信息,以便使用算法轻松解决益智游戏案例。利用算法的概念,最终得到符合规则的解谜排列结果,从而得到正确完成解谜游戏的决策系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信