Consider the minimax search scenario where it is agent A’s turn and the current state can be expanded in to states 1 and 2 where it is agent B’s turn. Each of those states can be expanded to 1.1, 1.2, 2.1, and 2.2, where it is again A’s turn. Now consider that each of those states can be expanded twice to the following eight states with corresponding evaluation scores from A’s evaluation function:1.1.1: 101.1.2: 51.2.1: 81.2.2: 92.1.1: 42.1.2: 52.2.1: 22.2.2: 9Consider lower numbered states are evaluated first. Which states would be pruned by alpha-beta minimax? give two answers.

Which CSP solving algorithm necessarily involves a stochastic approach?

A ____ is an atom or is a rule of the form h ← b where h is an atom and b is a body

What is the probability of rolling two fair dice and at least one comes up with the value 6?

Which is a model of the following:p ← q. q. r ← s.

If a fire alarm alerts 99% of the time a fire is present, and if there is a 0.001 probability of a fire on any given day and a 0.05 probability of hearing the fire alarm any given day, what is the probability that there is a fire present when you hear the alarm?

If a machine learning model were predicting coronavirus infections and correctly diagnosed 50 patients with coronavirus, incorrectly diagnosed 22 patients with coronavirus, correctly declined to diagnose 500 patients with coronavirus, and missed diagnosing 200 patients with coronavirus when those patients were indeed ill with the disease, what is the precision of this model in this testing scenario?  

If a k-means algorithm was classifying the datapoint (2,2) and currently had cluster centroids (1,0), (2,4), and (4, 5) for clusters 1, 2, and 3 respectively, which cluster would the datapoint (2,2) be assigned to, assuming euclidean distance?

Planning is finding a sequence of to take from an initial state to arrive at a goal state.

If KB is a set of clauses and g is a conjunction of atoms, g is a ____ of KB, written KB |= g , if g is true in every model of KB.