Open AccessChoice of Exhaustive or Heuristic Search to Solve AI Problems
Author(s) -
Dalya A. Gatsh
Publication year - 2019
Publication title -
mağallaẗ al-muẖtar li-l-ʿulūm
Language(s) - English
Resource type - Journals
eISSN - 2617-2186
pISSN - 2617-2178
DOI - 10.54172/mjsc.v34i2.81
Subject(s) - computer science , artificial intelligence , heuristic , simple (philosophy) , incremental heuristic search , combinatorial search , beam search , search problem , machine learning , search algorithm , algorithm , philosophy , epistemology
Artificial intelligence is an appealing area of research in computer science because it is concerned with the discovering of effective techniques that have been mainly motivated from human beings or their living environments to solve problems that have special nature. In this research, we aim first to introduce and analyze the common characteristics of problems that artificial intelligence interested in, and then we will highlight how to prepare such problems to solve them by search. The main goal of our study is helping us to decide which search strategy is better through investigating the behavior of most popular search strategies to find out the desired solution for two examples of a simple artificial intelligence problem. Our experiments presented that the required time and memory space to solve the problem mainly affected by many factors such as the applied search mechanism, the solution position, the number of available solutions, and the complexity in search.