Abstract:
Artificial Intelligence (AI) is the computational part of the
ability to achieve goal. A search algorithm, broadly speaking is
an algorithm that takes a problem as input and returns a
solution to the problem, usually after evaluating a number of
possible solutions. Most of the algorithms studied by computer
scientists that solve problems are kinds of search algorithms.
The set of all possible solutions to a problem is called the space.
Otherwise known as naive or uniformed , algorithms use the
simplest method of the searching through the search space ,
whereas informed search algorithms use heuristic functions to
apply knowledge about the structure of the search space to try to
reduce the amount of time spent searching’s-tree is a data
structure that maintains an ordered set of data and follows
efficient operations to find, delete, insert and browse the data. In
this system, B-tree and Binary search tree algorithms are used
for searching of Military terms and Weapons.
