MidTerm

Question 1

A* function

Answer 1

f(n) = g(n) + h(n)

Question 2

a* g(n) means?

Answer 2

cost of the path from the start node to node n

Question 3

A* h(n) means?

Answer 3

h(n) is a heuristic that est. the cost of the cheapest path from node n to end node.

Question 4

A* looks for f(n) to be small or bigger?

Answer 4

smaller

Question 5

Completeness

Answer 5

if at least one solution exists then the algorithm is guaranteed find a solution in a finite amount of time

Question 6

Optimal

Answer 6

algorithm will return the best solution

Question 7

Optimally Efficient

Answer 7

no other algorithm can do this faster

Question 8

Expectimax is optimal

Answer 8

false

Question 9

Expectimax does not require to search full tree

Answer 9

false

Question 10

Expectimax is modeled off ________ aglorithm, but it assumes ____________.

Answer 10

MiniMax

assumes that the adversary is more based off chance than playing optimally.

Question 11

Probcut

Answer 11

base on the idea that the result v of a shallow search with depth d is a rough estimate of the result v of a deeper search.

Question 12

Minimax has problems with? Why?

Answer 12

does not deal with high branching factors. It has to full search the tree

Question 13

Exploitation MCTS

Answer 13

wins/games

Question 14

Exploration MCTS

Answer 14

c*sqrt(ln parentSims/simsAfterIth)