Paper Contents
Abstract
The sheer volume of options quickly overwhelms a uniformed control strategy that chooses one random or every node to expand at each stage. The size of this task rises exponentially, making it an NP-complete problem. A search strategy incorporating such information is known as a heuristic search method. Heuristic information is used by many AI systems to lower search costs. These techniques might be quite expensive to uncover because they are frequently successful. Finding effective strategies for problem-solving will be even more crucial as computer power continues to grow. The 8 puzzle problem in this research is solved with the use of the heuristic function. This method seems to be more optimistic because there are just 8 puzzles, as opposed to the infinite number of answers that may be found via an exhaustive search.
Copyright
Copyright © 2023 Gaurav D Saxena. This is an open access article distributed under the Creative Commons Attribution License.
