adversarial search Flashcards
1
Q
what is a ply?
A
a move by a player
2
Q
what does b and , stand for? (minimax time complexity=O(bm)
‣
A
b = (average) branching factor(averane number of children per node)
‣ m = maximum depth of the tree
3
Q
why is alpha-beta search useless in Go?
A
because it would not be possible to see far ahead as Go starts with a branching factor of 361 and continues with an average branching
factor of 150.
4
Q
A
