UNIT- 1- ARTIFICIAL INTELLIGENCE- KCS-071

1
COURSE OBJECTIVES
To understand the various characteristics of Intelligent agents.
To learn the different search strategies in AI.
To learn to represent knowledge in solving AI problems.
To know about the various applications of AI.

UNIT 1 INTRODUCTION TO ARTIFICIAL INTELLIGENCE 9 Hrs.

Introduction–Definition – Future of Artificial Intelligence – Characteristics of Intelligent
Agents–Typical Intelligent Agents – Problem Solving Approach to Typical AI problems.
UNIT 2 PROBLEM SOLVING METHODS 9 Hrs.
Problem solving Methods – Search Strategies- Uninformed – Informed – Heuristics – Local
Search Algorithms and Optimization Problems – Searching with Partial Observations –
Constraint Satisfaction Problems – Constraint Propagation – Backtracking Search – Game
Playing – Optimal Decisions in Games – Alpha – Beta Pruning – Stochastic Games.
UNIT 3 KNOWLEDGE REPRESENTATION 9 Hrs.
First Order Predicate Logic – Prolog Programming – Unification – Forward Chaining-
Backward Chaining – Resolution – Knowledge Representation – Ontological Engineering-
Categories and Objects – Events – Mental Events and Mental Objects – Reasoning Systems
for Categories – Reasoning with Default Information.
UNIT 4 SOFTWARE AGENTS 9 Hrs.
Architecture for Intelligent Agents – Agent communication – Negotiation and Bargaining –
Argumentation among Agents – Trust and Reputation in Multi-agent systems.
UNIT 5 APPLICATIONS 9 Hrs.
AI applications – Language Models – Information Retrieval- Information Extraction –
Natural Language Processing – Machine Translation – Speech Recognition.
Max. 45 Hrs.

2
COURSE OUTCOMES
Artificial Intelligence (KCS071)
At the end of course , the student will be able to understand
Course Outcome ( CO) Bloom’s Knowledge Level
(KL)
CO1 Understand thebasics of the theory and practice of K2
Artificial Intelligence as a discipline and about
intelligent agents
CO 2 Understand search techniques and gaming theory. K2, K3

CO 3 The student will learn to apply knowledge K3 , K4

representation techniques and problem solving
strategies to common AI applications.
CO 4 Student should be aware of techniques used for K2 , K3
classification and clustering.
CO 5 Student should aware of basics of pattern K2 , K4
recognition and steps required for it.

3
 UNIT 1

INTRODUCTIONTO ARTIFICIAL INTELLIGENCE

Introduction–Definition –Future of Artificial Intelligence –Characteristics of Intelligent
Agents– Typical Intelligent Agents –Problem Solving Approach to Typical AI problems.

RODUCTION

INTELLIGENCE ARTIFICIAL INTELLIGENCE

It is a natural process. It is programmed by humans.
It is actually hereditary. It is not hereditary.
Knowledge is required for intelligence. KB and electricity are required to generate
output.
No human is an expert. We may get better Expert systems are made which aggregate
solutions from other humans. many person’s experience and ideas.

FINITION=
The study of how to make computers do things at which at the moment, people are better.
“Artificial Intelligence is the ability of a computer to act like a human being”.

 Systems that think like humans

 Systems that act like humans
 Systems that think rationally.
 Systems that act rationally.

Figure 1.1 Some definitions of artificial intelligence, organized into four categories

4
 (a) Intelligence - Ability to apply knowledge in order to perform better in an environment.
(b) Artificial Intelligence - Study and construction of agent programs that perform well
in a given environment, for a given agent architecture.
(c) Agent - An entity that takes action in response to precepts from an environment.
(d) Rationality - property of a system which does the “right thing” given what it knows.
(e) Logical Reasoning - A process of deriving new sentences from old, such that the new
sentences are necessarily true if the old ones are true.

Four Approaches of Artificial Intelligence:

 Acting humanly: The Turing test approach.
 Thinking humanly: The cognitive modelling approach.
 Thinking rationally: The laws of thought approach.
 Acting rationally: The rational agent approach.

TING HUMANLY: THE TURING TEST APPROACH

The Turing Test, proposed by Alan Turing (1950), was designed to provide a
satisfactory operational definition of intelligence. A computer passes the test if a human
interrogator, after posing some written questions, cannot tell whether the written responses
come from a person or from a computer.

Figure 1.2 Turing Test

 natural language processing to enable it to communicate successfully in English;

 knowledge representation to store what it knows or hears;
 automated reasoning to use the stored information to answer questions and to draw
new conclusions
 machine learning to adapt to new circumstances and to detect and extrapolate patterns.

5
 Total Turing Test includes a video signal so that the interrogator can test the
subject’s perceptual abilities, as well as the opportunity for the interrogator to pass physical
objects “through the hatch.” To pass the total Turing Test, the computer will need

• computer vision to perceive objects, and robotics to manipulate objects and move
about.

Thinking humanly: The cognitive modelling approach

Analyse how a given program thinks like a human, we must have some way of
determining how humans think. The interdisciplinary field of cognitive science brings
together computer models from AI and experimental techniques from psychology to try to
construct precise and testable theories of the workings of the human mind.

Although cognitive science is a fascinating field in itself, we are not going to be

discussing it all that much in this book. We will occasionally comment on similarities or
differences between AI techniques and human cognition. Real cognitive science, however, is
necessarily based on experimental investigation of actual humans or animals, and we assume
that the reader only has access to a computer for experimentation. We will simply note that
AI and cognitive science continue to fertilize each other, especially in the areas of vision,
natural language, and learning.

Thinking rationally: The “laws of thought” approach

The Greek philosopher Aristotle was one of the first to attempt to codify ``right
thinking,'' that is, irrefutable reasoning processes. famous syllogisms provided patterns for
argument structures that always gave correct conclusions given correct premises.

For example, ``Socrates is a man; all men are mortal; therefore Socrates is mortal.''

These laws of thought were supposed to govern the operation of the mind, and
initiated the field of logic.

Acting rationally: The rational agent approach

Acting rationally means acting so as to achieve one's goals, given one's beliefs. An
agent is just something that perceives and acts.

The right thing: that which is expected to maximize goal achievement, given the
available information

Does not necessary involve thinking.

For Example - blinking reflex- but should be in the service of rational action.

6
TURE OF ARTIFICIAL INTELLIGENCE

 Transportation: Although it could take a decade or more to perfect them,

autonomous cars will one day ferry us from place to place.

 Manufacturing: AI powered robots work alongside humans to perform a limited

range of tasks like assembly and stacking, and predictive analysis sensors keep
equipment running smoothly.

 Healthcare: In the comparatively AI-nascent field of healthcare, diseases are more

quickly and accurately diagnosed, drug discovery is sped up and streamlined, virtual
nursing assistants monitor patients and big data analysis helps to create a more
personalized patient experience.

 Education: Textbooks are digitized with the help of AI, early-stage virtual tutors
assist human instructors and facial analysis gauges the emotions of students to help
determine who’s struggling or bored and better tailor the experience to their
individual needs.

 Media: Journalism is harnessing AI, too, and will continue to benefit from it.
Bloomberg uses Cyborg technology to help make quick sense of complex financial
reports. The Associated Press employs the natural language abilities of Automated
Insights to produce 3,700 earning reports stories per year — nearly four times more
than in the recent past

 Customer Service: Last but hardly least, Google is working on an AI assistant that
can place human-like calls to make appointments at, say, your neighborhood hair
salon. In addition to words, the system understands context and nuance.

Languages used in Artificial Intelligence

Artificial Intelligence has become an important part of human life as we are now highly dependent on machines. Artificial
Intelligence is a very important technology to develop and build new computer programs and systems, which can be used
to simulate various intelligence processes like learning, reasoning, etc.

o Python

7
 o R
o Lisp
o Java
o C++
o Julia
o Prolog

1. Python

Python is one of the most powerful and easy programming languages that anyone can start to learn. Python is initially developed
in the early stage of 1991. Most of the developers and programmers choose Python as their favourite programming language for
developing Artificial Intelligence solutions. Python is worldwide popular among all developers and experts because it has more
career opportunities than any other programming language.

Python also comes with some default sets of standards libraries and also provides better community support to its users. Further,
Python is a platform-independent language and also provides an extensive framework for Deep Learning, Machine Learning,
and Artificial Intelligence.

Python is also a portable language as it is used on various platforms such as Linux, Windows, Mac OS, and UNIX.

Features of Python
o It is easy to learn than any other programming language.
o It is also a dynamically-typed language.
o Python is an Object-oriented language.
o It provides extensive community support and a framework for ML and DL.
o Open-source.
o Large standard sets of libraries.
o Interpreted language.

Python is an ideal programming language used for Machine Language, Natural Processing Language (NLP), and Neural
networks, etc. Due to the flexible nature of Python, it can be used for AI development. It contains various pre-existing libraries
such as Pandas, SciPy and nltk, etc. Further, Python also contains simple syntax and easy coding, which makes Python the first
choice of AI developers and programmers.

There are some standard Libraries in Python used for Artificial Intelligence as follows:

1. Tensor Flow Python 2.Keras Python 3.Theano Python 4.Scikit-Learn Python

5PyTorch Python 6.NumPy Python

2. Java

8
Java is also the most widely used programming language by all developers and programmers to develop machine learning
solutions and enterprise development. Similar to Python, Java is also a platform-independent language as it can also be easily
implemented on various platforms. Further, Java is an object-oriented and scalable programming language. Java allows virtual
machine technology that helps to create a single version of the app and provides support to your business. The best thing about
Java is once it is written and compiled on one platform, then you do not need to compile it again and again. This is known as
WORA (Once Written Read/Run Anywhere) principle.

Features of Java

Java has so many features which make Java best in industry and to develop artificial intelligence applications:

o Portability
o Cross-platform.
o Easy to learn and use.
o Easy-to-code Algorithms.

3. Prolog

Prolog is one of the oldest programming languages used for Artificial Intelligence solutions. Prolog stands for "Programming
in Logic", which was developed by French scientist Alain Colmerauer in 1970.

For AI programming in Prolog, developers need to define the rules, facts, and the end goal. After defining these three, the prolog
tries to discover the connection between them. Programming in AI using Prolog is different and has several advantages and
disadvantages.

It may seem like a bizarre language to learn for those programmers who are from a C++ background.

Prolog may not be a great programming language to build something big, but it's a great language to study and think about
problems in more logical ways rather than procedural.

Features of Prolog

o Supports basic mechanisms such as

o Pattern Matching,
o Tree-based data structuring, and

9
 o Automatic backtracking.
o Prolog is a declarative language rather than imperative.

4. Lisp

Lisp has been around for a very long time and has been widely used for scientific research in the fields of natural languages,
theorem proofs, and to solve artificial intelligence problems. Lisp was originally created as a practical mathematical notation for
programs but eventually became a top choice of developers in the field of AI.

Although Lisp programming language is the second oldest language after Fortran, it is still being used because of its crucial
features. The inventor of LISP programming was John McCarthy, who coined the term Artificial Intelligence.

LISP is one of the most efficient programming languages for solving specific problems. Currently, it is mainly used for machine
learning and inductive logic problems. It has also influenced the creation of other programming languages for AI, and some
worth examples are R and Julia.

However, though being so flexible, it has various deficiencies, such as lack of well-known libraries, not so-human-friendly
syntax, etc. Due to this reason, it is not preferred by the programmers.

Features of LISP
o The program can be easily modified, similar to data.
o Make use of recursion for control structure rather than iteration.
o Garbage Collection is necessary.
o We can easily execute data structures as programs.
o An object can be created dynamically.

5. R

R is one of the great languages for statistical processing in programming. However, R supports free, open-source programming
language for data analysis purposes. It may not be the perfect language for AI, but it provides great performance while dealing
with large numbers.

Some inbuilt features such as built-in functional programming, object-oriented nature, and vectorial computation make it
a worthwhile programming language for AI.

10
 What is an Agent

An agent is anything that can viewed as perceiving its environment through sensors and
acting upon that environment through effectors. environment agent percepts actions Sensors:
eyes, camera, … Effectors: hands, motors, … Examples: a human driver a robot driver a
driver based on programs

A generic agent diagram

Figure 1.3 Agent

An agent is anything that can be viewed as perceiving its environment through

sensors and acting upon that environment through actuators.

 Human Sensors:
 Eyes, ears, and other organs for sensors.
 Human Actuators:
 Hands, legs, mouth, and other body parts.
 Robotic Sensors:
 Mic, cameras and infrared range finders for sensors
 Robotic Actuators:
 Motors, Display, speakers etc An agent can be:

Human-Agent: A human agent has eyes, ears, and other organs which work for
sensors and hand, legs, vocal tract work for actuators.

Robotic Agent: A robotic agent can have cameras, infrared range finder, NLP for
sensors and various motors for actuators.

Software Agent: Software agent can have keystrokes, file contents as sensory input
and act on those inputs and display output on the screen.

Hence the world around us is full of agents such as thermostat, cell phone, camera,
and even we are also agents. Before moving forward, we should first know about sensors,
effectors, and actuators.

11
 Sensor: Sensor is a device which detects the change in the environment and sends the

information to other electronic devices. An agent observes its environment through

sensors.
Actuators: Actuators are the component of machines that converts energy into
motion. The actuators are only responsible for moving and controlling a system. An actuator
can be an electric motor, gears, rails, etc.

Effectors: Effectors are the devices which affect the environment. Effectors can be
legs, wheels, arms, fingers, wings, fins, and display screen.

12
PROPERTIES OF ENVIRONMENT

An environment is everything in the world which surrounds the agent, but it is not a
part of an agent itself. An environment can be described as a situation in which an agent is
present.

The environment is where agent lives, operate and provide the agent with something
to sense and act upon it.

Fully observable vs Partially Observable:

If an agent sensor can sense or access the complete state of an environment at each
point of time then it is a fully observable environment, else it is partially observable.

A fully observable environment is easy as there is no need to maintain the internal

state to keep track history of the world.

An agent with no sensors in all environments then such an environment is called as

unobservable.

Example: chess – the board is fully observable, as are opponent’s moves. Driving
– what is around the next bend is not observable and hence partially observable.

1. Deterministic vs Stochastic

 If an agent's current state and selected action can completely determine the next state
of the environment, then such environment is called a deterministic environment.

 A stochastic environment is random in nature and cannot be determined completely

by an agent.

 In a deterministic, fully observable environment, agent does not need to worry about
uncertainty.

2. Episodic vs Sequential

 In an episodic environment, there is a series of one-shot actions, and only the current
percept is required for the action.

 However, in Sequential environment, an agent requires memory of past actions to

determine the next best actions.

3. Single-agent vs Multi-agent

 If only one agent is involved in an environment, and operating by itself then such an
environment is called single agent environment.

13
 However, if multiple agents are operating in an environment, then such an
environment is called a multi-agent environment.

 The agent design problems in the multi-agent environment are different from single
agent environment.

4. Static vs Dynamic

 If the environment can change itself while an agent is deliberating then such
environment is called a dynamic environment else it is called a static environment.

 Static environments are easy to deal because an agent does not need to continue
looking at the world while deciding for an action.

 However for dynamic environment, agents need to keep looking at the world at each
action.

 Taxi driving is an example of a dynamic environment whereas Crossword puzzles are

an example of a static environment.

5. Discrete vs Continuous

 If in an environment there are a finite number of precepts and actions that can be
performed within it, then such an environment is called a discrete environment else it
is called continuous environment.

 A chess game comes under discrete environment as there is a finite number of moves
that can be performed.

 A self-driving car is an example of a continuous environment.

14
 6. Known vs Unknown

 Known and unknown are not actually a feature of an environment, but it is an agent's
state of knowledge to perform an action.

 In a known environment, the results for all actions are known to the agent. While in
unknown environment, agent needs to learn how it works in order to perform an
action.

 It is quite possible that a known environment to be partially observable and an

Unknown environment to be fully observable.

7. Accessible vs. Inaccessible

 If an agent can obtain complete and accurate information about the state's
environment, then such an environment is called an Accessible environment else it is
called inaccessible.

 An empty room whose state can be defined by its temperature is an example of an

accessible environment.

 Information about an event on earth is an example of Inaccessible environment.

Task environments, which are essentially the "problems" to which rational agents
are the "solutions."
Intelligent Agents:
An intelligent agent is an autonomous entity which act upon an environment using sensors and actuators for
achieving goals. An intelligent agent may learn from the environment to achieve their goals. A thermostat is an
example of an intelligent agent.

Following are the main four rules for an AI agent:

o Rule 1: An AI agent must have the ability to perceive the environment.

o Rule 2: The observation must be used to make decisions.
o Rule 3: Decision should result in an action.
o Rule 4: The action taken by an AI agent must be a rational action.

CHARACTERISTICS OF INTELLIGENT AGENTS Situatedness

The agent receives some form of sensory input from its environment, and it performs
some action that changes its environment in some way.

Examples of environments: the physical world and the Internet.

Autonomy

The agent can act without direct intervention by humans or other agents and that it has
control over its own actions and internal state.

15
 Adaptivity

The agent is capable of

(1) reacting flexibly to changes in its environment;
(2) taking goal-directed initiative (i.e., is pro-active), when appropriate; and
(3) Learning from its own experience, its environment, and interactions with others

Sociability

This type of characteristic means that the agent is capable of interacting in a peer-to-peer manner

with other agents or humans.

16
 Rational Agent - A system is rational if it does the “right thing”.. A rational agent is said to
perform the right things. AI is about creating rational agents to use for game theory and decision
theory for various real-world scenarios.

Characteristic of Rational Agent

 The agent's prior knowledge of the environment.

 The performance measure that defines the criterion of success.
 The actions that the agent can perform.
 The agent's percept sequence to date.

For every possible percept sequence, a rational agent should select an action that is
expected to maximize its performance measure, given the evidence provided by the percept
sequence and whatever built-in knowledge the agent has.

Rationality:

The rationality of an agent is measured by its performance measure. Rationality can be

judged on the basis of following points:

o Performance measure which defines the success criterion.

o Agent prior knowledge of its environment.
o Best possible actions that an agent can perform.
o The sequence of percepts.

The Structure of Intelligent Agents/AI Agents

Agent = Architecture + Agent Program

Architecture = the machinery that an agent executes on. (Hardware)
Agent Program = an implementation of an agent function. (Algorithm,
Logic – Software)

PEAS: Performance Measure, Environment, Actuators, Sensors

Performance

The output which we get from the agent. All the necessary results that an agent gives
after processing comes under its performance.

Environment

17
 All the surrounding things and conditions of an agent fall in this section. It basically
consists of all the things under which the agents work.

Actuators

The devices, hardware or software through which the agent performs any actions or
processes any information to produce a result are the actuators of the agent.

Sensors

The devices through which the agent observes and perceives its environment are the
sensors of the agent.

Figure Examples of agent types and their PEAS descriptions

18
 TYPES OF AGENTS

Agents can be grouped into four classes based on their degree of perceived
intelligence and capability :

 Simple Reflex Agents

 Model-Based Reflex Agents
 Goal-Based Agents
 Utility-Based Agents
 Learning Agent

The Simple reflex agents

 The Simple reflex agents are the simplest agents. These agents take decisions on the
basis of the current percepts and ignore the rest of the percept history (past State).

 These agents only succeed in the fully observable environment.

 The Simple reflex agent does not consider any part of percepts history during their
decision and action process.

 The Simple reflex agent works on Condition-action rule, which means it maps the
current state to action. Such as a Room Cleaner agent, it works only if there is dirt in
the room.

 Problems for the simple reflex agent design approach:

o They have very limited intelligence

o They do not have knowledge of non-perceptual parts of the current state

19
 o Mostly too big to generate and to store.

o Not adaptive to changes in the environment.

Condition-Action Rule − It is a rule that maps a state (condition) to an action.

Ex: if car-in-front-is-braking then initiate- braking.

Figure 1.6 A simple reflex agent

Model Based Reflex Agents

 The Model-based agent can work in a partially observable environment, and track the
situation.
 A model-based agent has two important factors:
o Model: It is knowledge about "how things happen in the world," so it is called a
Model-based agent.
o Internal State: It is a representation of the current state based on percept history.
 These agents have the model, "which is knowledge of the world" and based on the
model they perform actions.
 Updating the agent state requires information about:
o How the world evolves
o How the agent's action affects the world.

20
 Figure 1.7 A model-based reflex agent

Goal Based Agents

o The knowledge of the current state environment is not always sufficient to decide for
an agent to what to do.

o The agent needs to know its goal which describes desirable situations.

o Goal-based agents expand the capabilities of the model-based agent by having the
"goal" information.

o They choose an action, so that they can achieve the goal.

o These agents may have to consider a long sequence of possible actions before
deciding whether the goal is achieved or not. Such considerations of different scenario
are called searching and planning, which makes an agent proactive.

Figure 1.8 A goal-based agent

21
Utility Based Agents

o These agents are similar to the goal-based agent but provide an extra component of
utility measurement (“Level of Happiness”) which makes them different by
providing a measure of success at a given state.

o Utility-based agent act based not only goals but also the best way to achieve the goal.

o The Utility-based agent is useful when there are multiple possible alternatives, and an
agent has to choose in order to perform the best action.

o The utility function maps each state to a real number to check how efficiently each
action achieves the goals.

Figure 1.9 A utility-based agent

Learning Agents

o A learning agent in AI is the type of agent which can learn from its past experiences,
or it has learning capabilities.

o It starts to act with basic knowledge and then able to act and adapt automatically
through learning.

o A learning agent has mainly four conceptual components, which are:

a. Learning element: It is responsible for making improvements by learning from

environment

b. Critic: Learning element takes feedback from critic which describes that how
well the agent is doing with respect to a fixed performance standard.

c. Performance element: It is responsible for selecting external action

22
 d. Problem generator: This component is responsible for suggesting actions that
will lead to new and informative experiences.

o Hence, learning agents are able to learn, analyze performance, and look for new ways
to improve the performance.

Figure 1.10 Learning Agents

PROBLEM SOLVING APPROACH TO TYPICAL AI PROBLEMS Problem-solving

agents

In Artificial Intelligence, Search techniques are universal problem-solving methods.

Rational agents or Problem-solving agents in AI mostly used these search strategies or
algorithms to solve a specific problem and provide the best result. Problem- solving agents
are the goal-based agents and use atomic representation. In this topic, wewill learn various
problem-solving search algorithms.

 Some of the most popularly used problem solving with the help of artificial
intelligence are:

1. Chess.
2. Travelling Salesman Problem.
3. Tower of Hanoi Problem.
4. Water-Jug Problem.
5. N-Queen Problem.

Problem Searching

 In general, searching refers to as finding information one needs.

23
 Searching is the most commonly used technique of problem solving in artificial
intelligence.

 The searching algorithm helps us to search for solution of particular problem.

Problem: Problems are the issues which comes across any system. A solution is needed to
solve that particular problem.

Steps : Solve Problem Using Artificial Intelligence

 The process of solving a problem consists of five steps. These are:

Figure 1.11 Problem Solving in Artificial Intelligence

Defining The Problem: The definition of the problem must be included precisely. It
should contain the possible initial as well as final situations which should result in acceptable
solution.

1. Analyzing The Problem: Analyzing the problem and its requirement must be done as
few features can have immense impact on the resulting solution.

2. Identification Of Solutions: This phase generates reasonable amount of solutions to

the given problem in a particular range.

3. Choosing a Solution: From all the identified solutions, the best solution is chosen
basis on the results produced by respective solutions.

4. Implementation: After choosing the best solution, its implementation is done.

Measuring problem-solving performance

We can evaluate an algorithm’s performance in four ways:

24
 Completeness: Is the algorithm guaranteed to find a solution when there is one?
Optimality: Does the strategy find the optimal solution?
Time complexity: How long does it take to find a solution?
Space complexity: How much memory is needed to perform the search?

Search Algorithm Terminologies

 Search: Searching is a step by step procedure to solve a search-problem in a given

search space. A search problem can have three main factors:

1. Search Space: Search space represents a set of possible solutions, which a system
may have.

2. Start State: It is a state from where agent begins the search.

3. Goal test: It is a function which observe the current state and returns whether the
goal state is achieved or not.

 Search tree: A tree representation of search problem is called Search tree. The root of
the search tree is the root node which is corresponding to the initial state.

 Actions: It gives the description of all the available actions to the agent.

 Transition model: A description of what each action do, can be represented as a

transition model.

 Path Cost: It is a function which assigns a numeric cost to each path.

 Solution: It is an action sequence which leads from the start node to the goal node.
Optimal Solution: If a solution has the lowest cost among all solutions.

Example Problems

A Toy Problem is intended to illustrate or exercise various problem-solving methods.

Areal- world problem is one whose solutions people actually care about.

Toy Problems

Vacuum World

States: The state is determined by both the agent location and the dirt locations. The
agent is in one of the 2 locations, each of which might or might not contain dirt. Thus there
are 2*2^2=8 possible world states.

Initial state: Any state can be designated as the initial state.

25
 Actions: In this simple environment, each state has just three actions: Left, Right, and
Suck. Larger environments might also include Up and Down.

Transition model: The actions have their expected effects, except that moving Left in
the leftmost squ are, moving Right in the rightmost square, and Sucking in a clean square
have no effect. The complete state space is shown in Figure.

Goal test: This checks whether all the squares are clean.

Path cost: Each step costs 1, so the path cost is the number of steps in the path.

Figure 1.12 Vacuum World State Space Graph

1) 8- Puzzle Problem

Figure 1.13 8- Puzzle Problem

States: A state description specifies the location of each of the eight tiles and the
blank in one of the nine squares.

26
 Initial state: Any state can be designated as the initial state. Note that any given goal
can be reached from exactly half of the possible initial states.

The simplest formulation defines the actions as movements of the blank space Left,
Right, Up, or Down. Different subsets of these are possible depending on where the blank is.

Transition model: Given a state and action, this returns the resulting state; for
example, if we apply Left to the start state in Figure 3.4, the resulting state has the 5 and the
blank switched.

Goal test: This checks whether the state matches the goal configuration shown in
Figure. Path cost: Each step costs 1, so the path cost is the number of steps in the path.

Queens Problem

Figure 1.14 Queens Problem

 States: Any arrangement of 0 to 8 queens on the board is a state.

 Initial state: No queens on the board.
 Actions: Add a queen to any empty square.
 Transition model: Returns the board with a queen added to the specified square.
 Goal test: 8 queens are on the board, none attacked.

27
28