A comprehensive comparative study among important heuristic search algorithms in artificial intelligence

Dissertant

al-Qudah, Luayy Riyad Nawwaf

Thesis advisor

Abu Suud, Salih

Comitee Members

al-Qurayni, Shihadah
al-Qaddumi, Ashraf Ahmad
al-Majali, Sufyan

University

Princess Sumaya University for Technology

Faculty

King Hussein Faculty for Computing Sciences

Department

Department of Computer Sciences

University Country

Jordan

Degree

Master

Degree Date

2015

English Abstract

This study compares two blinds search algorithms (depth first search and breadth first search) and three heuristic search algorithms (best first search, hill-climbing search and A* search) according to some measurements such as: search space complexity, time complexity, optimality and completeness.

We compared the blinds search algorithms with the heuristics ones to notice the difference (gap) between blind search and heuristic search which is better.

In addition the study compares these algorithms in approaching the solution of a N-Puzzle of size 8 which will be used as scenario test according to some measurements such as: number of generated nodes, penetrance, solution length, running time and how the solution have been made.

The algorithms will be tested on an application was created as a benchmark to implement each algorithm and which one is preferred over another under various cases and extract valuable results, hopefully.

Eventually we recommend a flow chart according to our results that we obtained from the experiment on 8-puzzle approach, the chart facilitates how each search algorithm should be chosen.

Main Subjects

Information Technology and Computer Science

Topics

• Artificial intelligence
• Algorithms
• Simulation methods
• Data processing
• Logic machines
• Bionics

No. of Pages

61

Table of Contents

• APA
• MLA
• AMA

Language

English

Data Type

Arab Theses

Record ID

BIM-650988