Here's the question you clicked on:
moha_10
quyz plz help
moha Is it C language or java?
anaas can u plz guide me to solve
moha its an algorithm let me read it first then i can guide ok
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.
In computer science, a search algorithm is an algorithm for finding an item with specified properties among a collection of items
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.
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.
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)
Beta is the minimum upper bound of possible solutions
Alpha is the maximum lower bound of possible solutions
okay thoes just assumption right
ur two last response i meant
Thus, when any new node is being considered as a possible path to the solution, it can only work if: alpha <= N <= beta
@moha_10 http://cs.ucla.edu/~rosen/161/notes/alphabeta.html there are couple of examples that will help you
i think this will help you alot :)
ok do try it. there is a saying "practice makes perfect " :)