Artificial Intelligence

1. Artificial Intelligence is composed of two

words Artificial and Intelligence, where Artificial
defines "man-made," and intelligence defines "thinking power",
hence AI means "a man-made thinking power."

So, we can define AI as:

2. It is a branch of computer science by which we can create
intelligent machines which can behave like a human, think like
humans, and able to make decisions.

3. Artificial Intelligence exists when a machine can have human

based skills such as learning, reasoning, and solving problems

4. With Artificial Intelligence you do not need to preprogram a

machine to do some work, despite that you can create a
machine with programmed algorithms which can work with own
intelligence, and that is the awesomeness of AI.

5. It is believed that AI is not a new technology, and some people

says that as per Greek myth, there were Mechanical men in
early days which can work and behave like humans.

Importance -
o With the help of AI, you can create such software or devices
which can solve real-world problems very easily and with
accuracy such as health issues, marketing, traffic issues, etc.
o With the help of AI, you can create your personal virtual
Assistant, such as Cortana, Google Assistant, Siri, etc.
o With the help of AI, you can build such Robots which can work
in an environment where survival of humans can be at risk.
o AI opens a path for other new technologies, new devices, and
new Opportunities.
Advantages
o High Accuracy with less errors: AI machines or
systems are prone to less errors and high accuracy as it takes
decisions as per pre-experience or information.

o High-Speed: AI systems can be of very high-speed and

fast-decision making, because of that AI systems can beat a
chess champion in the Chess game.

o High reliability: AI machines are highly reliable and

can perform the same action multiple times with high accuracy.

o Useful for risky areas: AI machines can be helpful in

situations such as defusing a bomb, exploring the ocean floor,
where to employ a human can be risky.

o Digital Assistant: AI can be very useful to provide

digital assistant to the users such as AI technology is currently
used by various E-commerce websites to show the products as
per customer requirement.

o Useful as a public utility: AI can be very useful for

public utilities such as a self-driving car which can make our
journey safer and hassle-free, facial recognition for security
purpose, Natural language processing to communicate with the
human in human-language, etc.

o Enhanced Security: AI can be very helpful in

enhancing security, as It can detect and respond to cyber
threats in real time, helping companies protect their data and
systems.

o Aid in Research: AI is very helpful in the research field

as it assists researchers by processing and analyzing large
datasets, accelerating discoveries in fields such as astronomy,
genomics, and materials science.
 Applications
Artificial Intelligence has various applications in today's society. It is becoming essential for
today's time because it can solve complex problems with an efficient way in multiple industries,
such as Healthcare, entertainment, finance, education, etc. AI is making our daily life more
comfortable and fast.

Following are some sectors which have the application of Artificial Intelligence:

https://www.javatpoint.com/application-of-ai

Approches
1. Reactive machines
These machines are the most basic form of AI applications.
Examples of reactive machines are Deep Blue,
IBM's chess-playing supercomputer, and the same
computer that defeated the then-grand master of the world.
AI teams do not use training sets to feed the machines or
store subsequent data for future references. Based on the
move made by the opponent, the machine decides/predicts
the next move.
2. Limited memory
These machines belong to the Category II category of AI
applications, and Self-propelled cars are the perfect
example. Over time, these machines are fed with data and
trained on the speed and direction of other cars, lane
markings, traffic lights, curves of roads, and other
important factors.
3. Theory of mind
It is where we are struggling to make this concept work.
However, we are not there yet. Theory of mind is the
concept where bots will understand and react to human
emotions, thoughts.
If AI-powered machines are always mingling and moving
around with us, then understanding human behavior is
imperative. And then, it is necessary to react to such
behaviors accordingly.
4. Self-awareness
These machines are an extension of class III type AI, and it
is a step ahead of understanding human emotions. It is the
stage where AI teams build machines with self-awareness
factors programmed into them.
When someone is honking the horn from behind, the
machines must sense the emotion, and only then do they
understand what it feels like when they horn someone from
behind.

BFS
o It is not like huristic approach because in that we
know the estimation cost to reach the goal.
o But here we don’t the information about the goal,
that’s why we call it as uninformed search technique or
it is also known as Blind Search.
o It use FIFO which uses QUEUE Data Structure.
o Like as in queue we add elements vie tail and removes
it vie head.
o Bfs goes level wise but dfs goes through the end node
from one side.
o It gives answer definitely there is no chance that it
don’t give answer because it goes through out the
shallowed node , it complete each level so that any
element does not get missed.
o It give optimal results and gives the shortest
path.
o The time complexity is O(V+E) in Data structure
but in ai we write it as O(b<d on top >) where b
is an branch factor and d is depth.

DSF
o Uninformed is we know only present knowledge like we
know A will go to B but we don’t know B will go to
where in Un-informed search..
o It uses STACK which uses LIFO Data Structure.
o It will go to Deepest node rather than completing
each Levels, it will go to deepest node in one side only
and then it will backtrack If no node found.
o It will go to deepest with only one direction.
o There is Possibility of not getting results but bfs
will give result definitely.
o There is no possibility of getting an Optimal
Results, it is possible that there is an another short
path to go with less cost.

Informed Search
o Search With Information.-
o And that Information Is known as
Heuristic.
o Heuristic is Estimation(Estimation of
how to reach the goal).
o For Example, of Traveling Salesman
Problem.
o Use knowledge to find steps to a solution.
o Quick Solution.
o There is no guarantee of an optimal
solution.
o Less Time and Space Complexity.
o A*, Heuristic DFS, Best First Search

Un-Informed
Search
o Search without Information.-
 o Generally we call it Brute force approach or
blind searching.
o No Knowledge-
o We don’t know the knowledge of the
domain or problem.
o There is no guide to tell us whether we have
to this or that path.
o It is Time Consuming and It will Give
definitely optimal Solution.
o More Time/Space Complexity.
o DFS, BFS, Etc.

Heuristic(Approx./Estimation)
o A heuristic is a technique that is used to solve a problem faster
than the classic methods.
o These techniques are used to find the approximate solution of a
problem.
o Heuristics are said to be the Problem-Solving techniques that has
Quick solutions.
OR
o It’s a Technique designed to solve a problem quickly.
o Like in math’s we solve a problem by letting by estimation like Let
A is = xyz, so we estimate the solution by supposing a number to find
the solution quickly.
o The heuristic method might not always provide us the finest
solution.
o It guarantees Good Solution but not Optimal Solution.
o Like in Informed search there is an guide or an estimated value
that is Heuristic value.

Types
Greedy Heuristic
  The greedy heuristic makes the locally optimal choice at each stage
with the hope that this approach will lead to a global optimum. It’s
commonly used in algorithms like Dijkstra’s shortest path and the
greedy search.
 Example: In a pathfinding problem, choosing the path that seems
closest to the goal at each step.

Manhattan and Euclidean Distance Heuristics

 These are specific distance-based heuristics used for
pathfinding or grid-based problems.
o Manhattan Distance: Measures the distance
between two points in a grid-based path (e.g., a
chessboard) by only moving horizontally or
vertically.
o Euclidean Distance: Measures the straight-line
distance between two points in a continuous space.
 Example: These are used in algorithms like A* to
estimate the remaining distance to the goal.

Hill-Climbing Heuristic
 Hill climbing is a local search heuristic that iteratively
moves towards a solution by selecting the best
neighboring state. tIf i reaches a peak, it may require
additional strategies (e.g., simulated annealing) to
escape local optima.
 Example: Used in optimization problems where the
algorithm seeks the highest score or lowest cost.

Minimax and Alpha-Beta Pruning

Heuristics
 Minimax is used in game theory to minimize the
possible loss in a worst-case scenario, while alpha-beta
 pruning improves efficiency by cutting off branches that
won’t affect the outcome.
 Example: Common in two-player games like chess,
where the algorithm predicts the opponent’s best
possible moves.

Heuristic Search Techniques in Constraint

Satisfaction Problems (CSPs)
 These heuristics are applied to efficiently solve
problems with constraints, like scheduling or puzzles.
o Most Constrained Variable (MCV): Prioritizes
variables with the fewest possible values left,
reducing the search space.
o Least Constraining Value (LCV): Chooses the
value that leaves the most options open for other
variables.

A* Algo.
 A* search algorithm is a well-known
heuristic search method.
