Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

moha_10

  • 2 years ago

quyz plz help

  • This Question is Closed
  1. moha_10
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    1 Attachment
  2. moha_10
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    plz help

  3. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    moha Is it C language or java?

  4. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    http://cs.ucla.edu/~rosen/161/notes/alphabeta.html try this

  5. moha_10
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    ammmmmmmm may be java

  6. moha_10
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    anaas can u plz guide me to solve

  7. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    moha its an algorithm let me read it first then i can guide ok

  8. moha_10
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    okay thank u very much

  9. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Alpha-beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree.

  10. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    In computer science, a search algorithm is an algorithm for finding an item with specified properties among a collection of items

  11. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Minimax (sometimes minmax) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss for a worst case (maximum loss) scenario.

  12. moha_10
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    alright

  13. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    It is an adversarial search algorithm used commonly for machine playing of two-player games (Tic-tac-toe, Chess, Go, etc.). It stops completely evaluating a move when at least one possibility has been found that proves the move to be worse than a previously examined move. Such moves need not be evaluated further. When applied to a standard minimax tree, it returns the same move as minimax would, but prunes away branches that cannot possibly influence the final decision.

  14. moha_10
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    okay

  15. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Pseudocode: function alphabeta(node, depth, α, β, Player) if depth = 0 or node is a terminal node return the heuristic value of node if Player = MaxPlayer for each child of node α := max(α, alphabeta(child, depth-1, α, β, not(Player) )) if β ≤ α break (* Beta cut-off *) return α else for each child of node β := min(β, alphabeta(child, depth-1, α, β, not(Player) )) if β ≤ α break (* Alpha cut-off *) return β (* Initial call *) alphabeta(origin, depth, -infinity, +infinity, MaxPlayer)

  16. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Beta is the minimum upper bound of possible solutions

  17. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Alpha is the maximum lower bound of possible solutions

  18. moha_10
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    okay thoes just assumption right

  19. moha_10
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    ???

  20. moha_10
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    ur two last response i meant

  21. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    yes

  22. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Thus, when any new node is being considered as a possible path to the solution, it can only work if: alpha <= N <= beta

  23. moha_10
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    alright

  24. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    @moha_10 http://cs.ucla.edu/~rosen/161/notes/alphabeta.html there are couple of examples that will help you

  25. moha_10
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    okay nice

  26. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    i think this will help you alot :)

  27. moha_10
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    i'll try it

  28. annas
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    ok do try it. there is a saying "practice makes perfect " :)

  29. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Ask a Question
Find more explanations on OpenStudy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.