A Comprehensive Study on 8 Puzzle Problem without Heuristic and with Heuristic Algorithm

Authors

  • Palash Dutta Banik  Department of Computer Science, St. Xavier's College (Autonomous), Kolkata, India
  • Asoke Nath  Department of Computer Science, St. Xavier's College (Autonomous), Kolkata, India

DOI:

https://doi.org/10.32628/CSEIT22831

Keywords:

Artificial Intelligence, Informed Search, Uninformed Search, Heuristic Function, Depth First Search, Breadth First Search, Heuristic Search Function, A* algorithm.

Abstract

Artificial Intelligence (AI) is now one most challenging and important field of computer science. With the help of AI one can make the machine can think like a human being and deliver solutions like a human brain. Now a day’s AI replacing many old powerful technologies. There are many important areas where AI is used like a tool to achieve better solutions. Before introduction of AI algorithms, we were using search techniques like BFS, DFS, etc. But after the evolutionary change in computer science, now search techniques like Heuristic Search, A* algorithm, etc. were introduced to solve standard problems. With the help of some knowledge, one can easily find a solution for large and complex problems. In the present study the author will try to explore how one can solve 8-puzzle problem using heuristic search algorithm and also using non heuristic algorithm.

References

  1. Hewlett Packard Enterprise Website, 2020, https://www.hpe.com/in/en/what-is/artificial-intelligence.html?jumpid=ps_czxkg6qts3_aid-520061736&ef_id=Cj0KCQjwgYSTBhDKARIsAB8KukvXmK-Kaaxnev0jzv4LOdFDAshmpvqYDNq5_RRvA4v0-0HKpFRDL20aAsXTEALw_wcB:G:s&s_kwcid=AL!13472!3!558204152872!e!!g!!what%20is%20artificial%20intelligence!14386686693!128518517985&
  2. Varun Singla, Gate Smashers YouTube, 13 Dec, 2019, https://www.youtube.com/watch?v=_CrEYrcImv0
  3. Varun Singla, Gate Smashers YouTube, 15 Dec, 2019, https://www.youtube.com/watch?v=nmWGhb9E4es
  4. javaTpoint Website,2022, https://www.javatpoint.com/ai-informed-search-algorithms#:~:text=Heuristics%20function%3A%20Heuristic%20is%20a,agent%20is%20from%20the%20goal.
  5. geeksforgeeks website, 2022, https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/
  6. geeksforgeeks website, 2022, https://www.geeksforgeeks.org/breadth-first-search-or-bfs-for-a-graph/
  7. javaTpoint Website, 2022, https://www.javatpoint.com/heuristic-techniques
  8. javaTpoint Website, 2022, https://www.javatpoint.com/heuristic-techniques
  9. geeksforgeeks website, 2022, https://www.geeksforgeeks.org/difference-between-informed-and-uninformed-search-in-ai/
  10. Vinita, intellipaat website, 3 July, 2019, https://intellipaat.com/community/3654/what-is-the-difference-between-informed-and-uninformed-searches#:~:text=An%20uninformed%20search%20is%20a,current%20state%20to%20the%20goal.&text=Uses%20knowledge%20to%20find%20the%20steps%20to%20the%20solution.
  11. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms, Third Edition, 2017, Page – 594 to 595
  12. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms, Third Edition, 2017, Page – 603 to 608

Downloads

Published

2022-06-30

Issue

Section

Research Articles

How to Cite

[1]
Palash Dutta Banik, Asoke Nath, " A Comprehensive Study on 8 Puzzle Problem without Heuristic and with Heuristic Algorithm" International Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 8, Issue 2, pp.300-308, March-April-2022. Available at doi : https://doi.org/10.32628/CSEIT22831