Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    1-AI Excercises

    Uploaded by

    Xaocyc hosseini
    1. There are several search algorithms that can be used to solve problems including uninformed searches like breadth-first and depth-first, and informed searches like uniform-cost, greedy best-first, A* search, and minimax. 2. Constraint satisfaction problems can be solved using backtracking search and techniques like minimum remaining values, least constraining value, arc consistency, and backjumping to prune the search tree. 3. The minimax algorithm is commonly used for game playing and involves searching game trees to determine the best move by maximizing the minimum payoff against an optimal opponent. Evaluation functions help guide the search.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    1-AI Excercises

    Uploaded by

    Xaocyc hosseini
    6 views4 pages
    1. There are several search algorithms that can be used to solve problems including uninformed searches like breadth-first and depth-first, and informed searches like uniform-cost, greedy best-first, A* search, and minimax. 2. Constraint satisfaction problems can be solved using backtracking search and techniques like minimum remaining values, least constraining value, arc consistency, and backjumping to prune the search tree. 3. The minimax algorithm is commonly used for game playing and involves searching game trees to determine the best move by maximizing the minimum payoff against an optimal opponent. Evaluation functions help guide the search.

    Original Description:

    1-AI_Excercises

    Original Title

    1-AI_Excercises

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. There are several search algorithms that can be used to solve problems including uninformed searches like breadth-first and depth-first, and informed searches like uniform-cost, greedy best-first, A* search, and minimax. 2. Constraint satisfaction problems can be solved using backtracking search and techniques like minimum remaining values, least constraining value, arc consistency, and backjumping to prune the search tree. 3. The minimax algorithm is commonly used for game playing and involves searching game trees to determine the best move by maximizing the minimum payoff against an optimal opponent. Evaluation functions help guide the search.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    6 views4 pages

    1-AI Excercises

    Uploaded by

    Xaocyc hosseini
    1. There are several search algorithms that can be used to solve problems including uninformed searches like breadth-first and depth-first, and informed searches like uniform-cost, greedy best-first, A* search, and minimax. 2. Constraint satisfaction problems can be solved using backtracking search and techniques like minimum remaining values, least constraining value, arc consistency, and backjumping to prune the search tree. 3. The minimax algorithm is commonly used for game playing and involves searching game trees to determine the best move by maximizing the minimum payoff against an optimal opponent. Evaluation functions help guide the search.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 4

    97 – 98

    ( #)* $ '& – ! " # $"%&


    : -1

    /* 01 . &' ! " ()* ' + , - . !" #. % Z O


    : !" 0-3:; 7 8 (frontier) , 6' #02-' ! 234 %

    (breadth-first) = # 0-3:; .1
    (uniform-cost) 4 0 ? . 0-3:; .2
    (depth-first) A2# 0-3:; .3
    3 A2# (depth-limited) 1' A2# 0-3:; .4
    (iterative deepening) A2# ?' + . 0-3:; .5
    E; = # 0-3:; F3% = (bidirectional) &3E; 0-3:; .6

    F3% ?* 8 "I I0J; (explored set) 7 #02-' ! 234 % H G3 0 , 2*


    N ) K L' &* 0M 8 .( % 0-3:; )' I 0-3:; G3 0 ) &'
    R S3 T !0 # % &: J )F U* * *, 6' ()* ' &3 (successor) QOP KH
    R S3 R W)X K 3 0; QOP KH N 0 &' O V' ! 0 # . 0 &'
    . 0 &'

    8 6' hD (heuristic) & "3 Y * . &J)X 0% –2


    : % Z:' N
    A 650 K 900 S 550 Y 900
    B 500 M 1150 R 1100 Z 0
    E 800 O 1150 T 950

    1
    \ : (consistent) I % (admissible) & 3 [P hD Q &% .1
    . &% ! 0 & 3 [P !Q E " P Z:' N ; & "3 Y * 8 .2
    . U * ? E Q ! ?' K 0M : 6' hD & "3 Y * W)X 0% E " P & "3 Y * .3
    0-3:; G3 0 8 hD & "3 Y * F3% , Z:' N W (frontier) , 6' #02-' /* 01
    : !"
    (greedy best-first) ] N 3E 0-3:; .4
    A* 0-3:; .5
    8 . &' F3% ?* 8 "I I0J; (explored set) "' #02-' H G3 0
    *, 6' ()* ' &3 (successor) QOP KH N ) K L' &* 0M
    KH N &3 0 &' O V' ! 0 # . 0 &' R S3 T !0 # % &: J )F U* *
    . 0 &' R S3 R W)X K 3 0; QOP

    !" W? (objective function) Y* 6' 2 T 8 &"S – 3


    -' 4 &? + 8 0*&' Z:' W W' # . % Y* 6' N 3" &3 ! % . %
    . &' ! " W' # &JT ! ?' (C5 4) a & Q .( 0" ` 4 ( 1' &* 0M ) N P H % ^_

    A B C D E F G H
    1 7 5 6 3 5 6 9 8
    2 6 5 2 1 5 5 8 7
    3 4 4 3 4 4 5 5 6
    4 3 4 3 3 3 1 4 4
    5 4 2 2 1 1 1 2 4
    6 2 3 3 2 1 3 5 6
    7 4 4 3 3 1 5 8 8
    8 2 3 5 2 1 6 8 8
    N -' KH &? & ]* R S3 K 0M ) !" 0-3:;
    W' # KH G3 0 8 [I 01
    .( b c0d0'
    .3 Tabu : F3% G -' 4 & 03' 5 V ! ?' (hill climbing) 0 e* .1
    T -' c a &Q .- &' -' c 3 (random restart) & ]* -' c 0 e* .2
    . F5 D2
    (ΔE < 0) * T R S3 ! ?' K 0M . ?* 10 (simulated annealing) % ) )* .3
    : % K 0M % ^_ U * * ?*
    Step 1 2 3 4 5 6 7 8 9 10

    P(next-worse) 0 1 0 0 1 0 0 0 1 0

    .2 2:X 3FI c k=3 (local beam) &Td0' 0* P . 4

    2
    . % 4 " % 2% 4 Minimax 6' !Q % W? 4 8 &"S – 4

    \ % 6_ !Q ^_ 2% 4 % 4 ( ply g] ) A2# .1

    . ! W b Minimax G 2]* .2

    minimax 6' N3: = 0 F3% (alpha – beta pruning) 3 – F Q 0-3:; IG 2]* I .3


    2% 4 minimax 6' I \ 04 " ^_ 2% 4 & 4 _ (MM=3) % 2% 4
    . j d0* \ 04 i 4 Q ) hS"' %

    6' 0 ') % 3 I Eval(x)=2Minimax(x)-1 K 0M &d (evaluation function) & Y * .4


    Y * (6 ?J : G3 0 3% k 2 63:' 0 &' = 0% N % &J)X 2:X )% 1' Minimax
    heuristic-) & "3 Minimax 6' (cutoff) 0 YlX (ply) G 3 T 0-3:; I .( &% 3% !Q &
    . )% 1' 2 0% 'Q % 6' ;0* " (Minimax

    : % K 0] & 0'Q :%m' 8 (exam timetabling) K 13' )' Z:' 8 – 5


    K 13' 8 . .I 2!' K' &J ]1* , * ! n gJ3S' 10 K 13' ]X :%m' !Hm:'
    N K 13' , )q 8 + ! 0'Q+ &4 k T)p . 0 .I Eo T j)M 0 &? 0*&'
    3 } {4 2 1 }: * )# 3: r 3"' ! 0'Q+ & . 0 .I ! ' 8 )
    {10 9 5 } {9 8 6 4 } {6 3 1 } {7 5 2 } {4
    : 0 .I 8 0*&2 K 13' & 0'Q 1' W L# .{10 8 7 }
    .{7 6 } {5 1 }

    . g T* (constraint satisfaction problem – CSP) X x d Z:' 8 K 0M Z:' N .1

    ! " 1 0% g T* CSP ( (backtracking search) IU6# 0-3:; G3 0 ; W ' .2


    :

    3
    ; (minimum remaining values – MRV) 2 X 6' N 32 & "3 Y 0* U * * /3' R S3 •
    R S3 W ) 0 &' R S3 32 2 /3' 0 ! :? 0 /3' _ G I . 0 &' F3% (degree)
    .( 0 b /3'
    . 0 &' F3% (least constraining value – LCV) 2 &I 6' 6' & "3 Y * 6' R S3 •
    . 0 &' F3% (arc consistency) I % & 3)' (forward checking) 0J; &% 7 ` 3 3% •
    #02-' /3') * #02-' /3' N * * (backjumping) U6# 7 P 7 IU6# K 0M •
    . 0 &' F3% ( % & 6' 2 * (conflict set) *

    : ! " J ' 10 1 0% g T* CSP ( 0 e* 0-3:; ; .3


    ... ,0% /3' T , /3' Oe% /3' 3 : 0 &' R S3 2 U * * /3' •
    W ) ?* z & &JT 7 ! 0*&' ) 3E , ?y 8 N -' N I •
    . R S3 (0-3:;

    . 0 &' F3% (minimum conflicts) * N 32 & "3 Y * /3' & 6'

    ,- (Artificial Intelligence: A Modern Approach) Y) ' R 3 &: J S: GE G3" W] K 2* – 6


    .

    8.6 .1
    8.9 .2
    8.10 .3
    8.24 .4
    9.9 .5

    You might also like