Scribd Logo
Upload

Welcome to Scribd!

  • 6 Pruningreview

    Uploaded by

    viraj gupta
    5 views7 pages
    - Alpha-beta pruning is a technique used in game tree search that prunes branches that cannot possibly change the outcome. It skips evaluating branches that do not affect the final decision. - The example shows a game tree being pruned at each step by comparing the maximum value of child nodes to alpha and the minimum value to beta to avoid unnecessary evaluations. Nodes below the pruning threshold are not explored, improving search efficiency.

    Original Description:

    Original Title

    6.pruningReview

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    - Alpha-beta pruning is a technique used in game tree search that prunes branches that cannot possibly change the outcome. It skips evaluating branches that do not affect the final decision. - The example shows a game tree being pruned at each step by comparing the maximum value of child nodes to alpha and the minimum value to beta to avoid unnecessary evaluations. Nodes below the pruning threshold are not explored, improving search efficiency.

    Copyright:

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

    6 Pruningreview

    Uploaded by

    viraj gupta
    - Alpha-beta pruning is a technique used in game tree search that prunes branches that cannot possibly change the outcome. It skips evaluating branches that do not affect the final decision. - The example shows a game tree being pruned at each step by comparing the maximum value of child nodes to alpha and the minimum value to beta to avoid unnecessary evaluations. Nodes below the pruning threshold are not explored, improving search efficiency.

    Copyright:

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

    Alpha beta pruning

    • Some branches will never be played by rational players since


    they include sub-optimal decisions (for either player)

    CS 2710 Foundations of AI

    Alpha beta pruning. Example

    MAX

    MIN

    MA
    X

    4 3 6 2 2 1 9
    5 3 1 5 4 7 5

    CS 2710 Foundations of AI
    Alpha beta pruning. Example

    MAX

    MIN

    MAX  4

    4 3 6 2 2 1 9
    5 3 1 5 4 7 5

    CS 2710 Foundations of AI

    Alpha beta pruning. Example

    MAX

    MIN
     4

    MAX
     4

    4 3 6 2 2 1 9
    5 3 1 5 4 7 5

    CS 2710 Foundations of AI
    Alpha beta pruning. Example

    MAX

    MIN
     4

    MAX
    !!
     4 
    6

    4 3 6 2 2 1 9
    5 3 1 5 4 7 5

    CS 2710 Foundations of AI

    Alpha beta pruning. Example

    MAX  4

    MIN
     4

    MAX 6
     4

    4 3 6 2 2 1 9
    5 3 1 5 4 7 5

    CS 2710 Foundations of AI
    Alpha beta pruning. Example

    MAX  4

    MIN
     4

    MAX 6  2
     4

    4 3 6 2 2 1 9
    5 3 1 5 4 7 5

    CS 2710 Foundations of AI

    Alpha beta pruning. Example

    MAX  4

    MIN  2
     4

    MAX 6  2
     4

    4 3 6 2 2 1 9
    5 3 1 5 4 7 5

    CS 2710 Foundations of AI
    Alpha beta pruning. Example

    MAX  4

    !!
    MIN  4  2

    MAX 6  2
     4

    4 3 6 2 2 1 9
    5 3 1 5 4 7 5

    CS 2710 Foundations of AI

    Alpha beta pruning. Example

    MAX  4

    MIN  2
     4

    MAX 6  2 5
     4

    4 3 6 2 2 1 9
    5 3 1 5 4 7 5

    CS 2710 Foundations of AI
    Alpha beta pruning. Example

    MAX  4

    MIN  2 5
     4

    MAX 6  2 5
     4

    4 3 6 2 2 1 9
    5 3 1 5 4 7 5

    CS 2710 Foundations of AI

    Alpha beta pruning. Example

    MAX  4

    MIN  2 5
     4

    !!
    MAX 6  2 5 7
     4

    4 3 6 2 2 1 9
    5 3 1 5 4 7 5

    CS 2710 Foundations of AI
    Alpha beta pruning. Example

    MAX 5

    MIN  2 5
     4

    MAX 6  2 5 7
     4

    4 3 6 2 2 1 9
    5 3 1 5 4 7 5

    CS 2710 Foundations of AI

    Alpha beta pruning. Example

    MAX 5

    MIN 2 5
     4

    MAX 6 2 5 7
     4

    4 3 6
    2 2 1 9 5 3 1 5 4 7

    nodes that were never explored !!!


    CS 2710 Foundations of AI

    You might also like