A community for students. Sign up today!
Here's the question you clicked on:
 0 viewing

This Question is Closed

annas
 2 years ago
Best ResponseYou've already chosen the best response.1moha Is it C language or java?

moha_10
 2 years ago
Best ResponseYou've already chosen the best response.0anaas can u plz guide me to solve

annas
 2 years ago
Best ResponseYou've already chosen the best response.1moha its an algorithm let me read it first then i can guide ok

annas
 2 years ago
Best ResponseYou've already chosen the best response.1Alphabeta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree.

annas
 2 years ago
Best ResponseYou've already chosen the best response.1In computer science, a search algorithm is an algorithm for finding an item with specified properties among a collection of items

annas
 2 years ago
Best ResponseYou've already chosen the best response.1Minimax (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.

annas
 2 years ago
Best ResponseYou've already chosen the best response.1It is an adversarial search algorithm used commonly for machine playing of twoplayer games (Tictactoe, 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.

annas
 2 years ago
Best ResponseYou've already chosen the best response.1Pseudocode: 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, depth1, α, β, not(Player) )) if β ≤ α break (* Beta cutoff *) return α else for each child of node β := min(β, alphabeta(child, depth1, α, β, not(Player) )) if β ≤ α break (* Alpha cutoff *) return β (* Initial call *) alphabeta(origin, depth, infinity, +infinity, MaxPlayer)

annas
 2 years ago
Best ResponseYou've already chosen the best response.1Beta is the minimum upper bound of possible solutions

annas
 2 years ago
Best ResponseYou've already chosen the best response.1Alpha is the maximum lower bound of possible solutions

moha_10
 2 years ago
Best ResponseYou've already chosen the best response.0okay thoes just assumption right

moha_10
 2 years ago
Best ResponseYou've already chosen the best response.0ur two last response i meant

annas
 2 years ago
Best ResponseYou've already chosen the best response.1Thus, when any new node is being considered as a possible path to the solution, it can only work if: alpha <= N <= beta

annas
 2 years ago
Best ResponseYou've already chosen the best response.1@moha_10 http://cs.ucla.edu/~rosen/161/notes/alphabeta.html there are couple of examples that will help you

annas
 2 years ago
Best ResponseYou've already chosen the best response.1i think this will help you alot :)

annas
 2 years ago
Best ResponseYou've already chosen the best response.1ok do try it. there is a saying "practice makes perfect " :)
Ask your own question
Ask a QuestionFind 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
 Engagement 19 Mad Hatter
 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.