artificial intelligence
-------------------------------------------------------------------------------------------------------
CS1351 –ARTIFICIAL INTELLIGENCE VI SEMESTER CSE
AUTHORS
N.Vivekananthamoorthy
S.Sankar
Department of CSE
KCG College of Technology,Chennai-97
UNIT-II
(2) SEARCHING TECHNIQUES
-----------------------------------------------------------------------------------------
2.1 INFORMED SEARCH AND EXPLORATION
2.1.1 Informed(Heuristic) Search Strategies
2.1.2 Heuristic Functions
2.1.3 Local Search Algorithms and Optimization Problems
2.1.4 Local Search in Continuous Spaces
2.1.5 Online Search Agents and Unknown Environments
-----------------------------------------------------------------------------------------------------------------------
2.2 CONSTRAINT SATISFACTION PROBLEMS(CSP)
2.2.1 Constraint Satisfaction Problems
2.2.2 Backtracking Search for CSPs
2.2.3 The Structure of Problems
---------------------------------------------------------------------------------------------------------------------------------
2.3 ADVERSARIAL SEARCH
2.3.1 Games
2.3.2 Optimal Decisions in Games
2.3.3 Alpha-Beta Pruning
2.3.4 Imperfect ,Real-time Decisions
2.3.5 Games that include Element of Chance
-----------------------------------------------------------------------------------------------------------------------------
2.1 INFORMED SEARCH AND EXPLORATION
2.1.1 Informed(Heuristic) Search Strategies Informed search strategy is one that uses problem-specific knowledge beyond the definition of the problem itself. It can find solutions more efficiently than uninformed strategy.
Best-first search
Best-first search is an instance of general TREE-SEARCH or GRAPH-SEARCH algorithm in which a node is selected for expansion based on an evaluation function f(n). The node with lowest evaluation is selected for expansion,because the evaluation measures the distance to the goal.
This can be implemented using a
CS1351 –ARTIFICIAL INTELLIGENCE VI SEMESTER CSE
AUTHORS
N.Vivekananthamoorthy
S.Sankar
Department of CSE
KCG College of Technology,Chennai-97
UNIT-II
(2) SEARCHING TECHNIQUES
-----------------------------------------------------------------------------------------
2.1 INFORMED SEARCH AND EXPLORATION
2.1.1 Informed(Heuristic) Search Strategies
2.1.2 Heuristic Functions
2.1.3 Local Search Algorithms and Optimization Problems
2.1.4 Local Search in Continuous Spaces
2.1.5 Online Search Agents and Unknown Environments
-----------------------------------------------------------------------------------------------------------------------
2.2 CONSTRAINT SATISFACTION PROBLEMS(CSP)
2.2.1 Constraint Satisfaction Problems
2.2.2 Backtracking Search for CSPs
2.2.3 The Structure of Problems
---------------------------------------------------------------------------------------------------------------------------------
2.3 ADVERSARIAL SEARCH
2.3.1 Games
2.3.2 Optimal Decisions in Games
2.3.3 Alpha-Beta Pruning
2.3.4 Imperfect ,Real-time Decisions
2.3.5 Games that include Element of Chance
-----------------------------------------------------------------------------------------------------------------------------
2.1 INFORMED SEARCH AND EXPLORATION
2.1.1 Informed(Heuristic) Search Strategies Informed search strategy is one that uses problem-specific knowledge beyond the definition of the problem itself. It can find solutions more efficiently than uninformed strategy.
Best-first search
Best-first search is an instance of general TREE-SEARCH or GRAPH-SEARCH algorithm in which a node is selected for expansion based on an evaluation function f(n). The node with lowest evaluation is selected for expansion,because the evaluation measures the distance to the goal.
This can be implemented using a