Question

quyz plz help

Answer 1

plz help

Answer 2

moha Is it C language or java?

Answer 3

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

Answer 4

ammmmmmmm may be java

Answer 5

anaas can u plz guide me to solve

Answer 6

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

Answer 7

okay thank u very much

Answer 8

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.

Answer 9

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

Answer 10

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.

Answer 11

alright

Answer 12

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.

Answer 13

okay

Answer 14

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)

Answer 15

Beta is the minimum upper bound of possible solutions

Answer 16

Alpha is the maximum lower bound of possible solutions

Answer 17

okay thoes just assumption right

Answer 18

???

Answer 19

ur two last response i meant

Answer 20

yes

Answer 21

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

Answer 22

alright

Answer 23

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

Answer 24

okay nice

Answer 25

i think this will help you alot :)

Answer 26

i'll try it

Answer 27

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