## moha_10 3 years ago quyz plz help

1. moha_10

2. moha_10

plz help

3. annas

moha Is it C language or java?

4. annas
5. moha_10

ammmmmmmm may be java

6. moha_10

anaas can u plz guide me to solve

7. annas

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

8. moha_10

okay thank u very much

9. annas

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

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

11. annas

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

alright

13. annas

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

okay

15. annas

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

Beta is the minimum upper bound of possible solutions

17. annas

Alpha is the maximum lower bound of possible solutions

18. moha_10

okay thoes just assumption right

19. moha_10

???

20. moha_10

ur two last response i meant

21. annas

yes

22. annas

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

alright

24. annas

25. moha_10

okay nice

26. annas

27. moha_10

i'll try it

28. annas

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