Professional Documents
Culture Documents
1
Definition:
2
•Common sense
•Moving Around
•Language
Domains of AI
4
• Mundane tasks
Perception
-Vision
- Speech
Natural language understanding
Formal tasks
Games
Mathematics
Expert Problem Solving
Medical Diagnosis
Engineering
The Origins of AI
5
Marvin Minsky
John McCarthy
6
Philosophical extremes in AI
Neats vs. Scruffies
Neats focus on smaller, simplified problems that can be well-
understood, then attempt to generalize lessons learned
Scruffies tackle big, hard problems directly using less formal
approaches
7
4 questions
8
PSS
Set of symbols which are physical patterns
Symbol structure – a number of instances/tokens of symbols related
in some physical way
Processes which operate on expressions to produce other expressions
PSSH – A PSS has the necessary and sufficient means for
general intelligent action
But PSSH cannot be proved or disproved on logical grounds
Must be subjected to empirical validation
What is an AI Technique?
10
Generalizations
Understood by people
Easily modified
Used in a great many situations
Can be used to reduce the possibilities
that must be considered
Example: Tic-Tac-Toe program
complexity
use of generalizations
clarity of knowledge
extensibility
12
Program 1
13
Data Structures 1 2 3
Board: 9-element vector 4 5 6
0 : blank, 1 : X , 2 : O 7 8 9
Move table: a large vector of 39 elements each
element of each is a 9-element vectors
The Algorithm:
1. transform board vector from base 3 to 10
2. use (1) as the move table index
3. change the board by using the vector from (2)
Comments:
14
Advantages:
efficient in terms of time,
optimal game of tic-tac-toe in theory
Disadvantages:
space - move table space
lot of work - for specifying entries in the move table
error prone - move table
three dimension - 327, no longer work at all
Program 2
15
Data Structures:
Board: program1
2 : blank, 3 : X, 5 : O
Turn: game moves 1,2,3,.....9
odd-numbered move : x
even-numbered move : o
Turn=1 Go (1)
Turn=2 Go (5) or Go (1)
Turn=3 Go (9) or Go (3)
Turn=4 Go(Posswin(X)) or Go(Make2)
Turn=5 Go(Posswin(X)), or Go(Posswin(O)), or
Go(7), or Go(3) [fork]
…
Comments:
17
program 2 board
magic square 15
possible win check:
S = sum of two paired owned by a player
D = 15 – S
if 0 < D < 10 and Board [D] is empty then the player
can win
8 3 4
1 5 9
6 7 2
18
Program 3 : minimax
19
O
X
O O X O O
X X
0
X -10 X
O O X O O O O O X O
X X X X
X X X X X X
-10 10 10 0
O O O O O O O O O O O X O O X O
X X X X X X
X X X O X X X X O X X O X O
10 -1 10 0 0 0
Comments
20
Extendable
AI technique