Comparing the Hamming and Manhattan Heuristics in Solving the 8—Puzzle by A* Algorithm-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Comparing the Hamming and Manhattan Heuristics in Solving the 8—Puzzle by A* Algorithm

Published:2022 Issue: Volume: Page:189-195
ISSN:0930-8989
Container-title:Springer Proceedings in Physics
language:
Short-container-title:

Author:

Lee Siaw Chong^ORCID,See Tyan Her

Publisher

Springer Nature Singapore

Link

https://link.springer.com/content/pdf/10.1007/978-981-16-8903-1_19

Reference7 articles.

1. E.O. Osaghae, An alternative solution to N-puzzle problem. J. Appl. Sci. Environ. Manag. 22(8), 1199–1205 (2018). https://doi.org/10.4314/jasem.v22i8.9

2. A.K. Mishra, P.C. Siddalingaswamy, Analysis of Tree Based Search Techniques for Solving 8-puzzle Problem. In Conference 2016, LNCS 9999 (Springer Heidelberg, 2016), pp. 1–13

3. R.E. Korf, Recent Progress in the Design and Analysis of Admissible Heuristic Functions. In International Symposium on Abstraction, Reformulation, and Approximation. (Springer, Berlin, 2000), pp. 45–55. https://doi.org/10.1007/3-540-44914-0_3

4. B.M. Sathyaraj, L.C. Jain, A. Finn, S. Drake, Multiple UAVs path planning algorithms: A comparative study. Fuzzy Optim. Decis. Making 7(3), 257–267 (2008). https://doi.org/10.1007/s10700-008-9035-0

5. K. Mathew, M. Tabassum, Experimental comparison of uninformed and heuristic AI algorithms for N puzzle and 8 queen puzzle solution. Int. J. Digital Inf. Wirel. Commun. 4(1), 143–154 (2014). https://doi.org/10.17781/P001092

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Informedness and Effectiveness in Search: Heuristic Simplicity and Algorithm Complexity;2023 IEEE 3rd International Maghreb Meeting of the Conference on Sciences and Techniques of Automatic Control and Computer Engineering (MI-STA);2023-05-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3