Scribd Logo
Upload

Welcome to Scribd!

  • U2 Alpa Beta Cutoff

    Uploaded by

    NatarajanBalasubramaniyan
    8 views17 pages
    The document describes an algorithm for determining the optimal move in a game tree using alpha-beta pruning. It shows an example game tree and demonstrates how the alpha and beta values are updated at each node to prune subtrees that cannot contain a better move than already found. It finds the mini-max value of the root node to be 70, indicating the best possible move.

    Original Description:

    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
    The document describes an algorithm for determining the optimal move in a game tree using alpha-beta pruning. It shows an example game tree and demonstrates how the alpha and beta values are updated at each node to prune subtrees that cannot contain a better move than already found. It finds the mini-max value of the root node to be 70, indicating the best possible move.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    8 views17 pages

    U2 Alpa Beta Cutoff

    Uploaded by

    NatarajanBalasubramaniyan
    The document describes an algorithm for determining the optimal move in a game tree using alpha-beta pruning. It shows an example game tree and demonstrates how the alpha and beta values are updated at each node to prune subtrees that cannot contain a better move than already found. It finds the mini-max value of the root node to be 70, indicating the best possible move.

    Copyright:

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

    ALPHA – BETA CUT OFF

    (EXAMPLE)
    TOPIC: GAME PLAYING
    Version 1.0 Unit – 1
    α=50

    β=50

    α=50

    β=50

    50
    α=40

    β=40

    α=40

    β=40

    50 40
    α=40

    β=40

    α=40

    β=40 β=30

    50 40 30
    α=40

    β=40

    α=40

    β=40 β=30

    α Cut off
    ie: 40 > 30 [Min Node]

    50 40 30
    α=40

    β=40

    α=40 α=70

    β=40 β=30 β=70

    50 40 30 70
    α=40

    β=40

    α=40 α=60

    β=40 β=30 β=60

    50 40 30 70 60
    α=40

    β=40

    α=40 α=60

    β Cut off
    ie: 40 < 60 [Max node]
    β=40 β=30 β=60

    50 40 30 70 60
    α=40

    β=40
    β=30

    α=40 α=60 α=30

    β=40 β=30 β=60 β=30

    50 40 30 70 60 30
    α=40

    β=40
    β=30

    α=40 α=60 α=30

    β=40 β=30 β=60 β=30

    α Cut off
    ie: 40 > 30 [Min Node]

    50 40 30 70 60 30
    α=70

    β=40
    β=70

    α=40 α=60 α=70

    β=40 β=30 β=60 β=30 β=70

    50 40 30 70 60 30 70
    α=70

    β=40
    β=70

    α=40 α=60 α=70

    β=40 β=30 β=60 β=30 β=70

    50 40 30 70 60 30 70 80
    α=70

    β=40
    β=70

    α=40 α=60 α=70 α=80

    β=40 β=30 β=60 β=30 β=70 β=80

    50 40 30 70 60 30 70 80 80
    α=70

    β=40
    β=70

    α=40 α=60 α=70 α=80

    β=40 β=30 β=60 β=30 β=70 β=80

    50 40 30 70 60 30 70 80 80 90
    α=70

    β=40
    β=70
    β Cut off

    α=40 α=60 α=70 α=80

    β=40 β=30 β=60 β=30 β=70 β=80

    50 40 30 70 60 30 70 80 80 90
    α=70 MiniMax value=70

    β=40
    β=70

    α=40 α=60 α=70 α=80

    β=40 β=30 β=60 β=30 β=70 β=80

    50 40 30 70 60 30 70 80 80 90

    You might also like