The choice of exhaustive or heuristic search to solve AI problems
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...
Saved in:
| Published in | مجلة المختار للعلوم Vol. 34; no. 2; pp. 91 - 104 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Arabic English |
| Published |
al-Bayda, Libya
Omar al-Mukhtar University
30.06.2019
Omar Al-Mukhtar University |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Summary: | 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. |
|---|---|
| ISSN: | 2617-2178 2617-2186 |
| DOI: | 10.54172/mjsc.v34i2.81 |