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: 9Which state would the minimax algorithm move agent A in to?

The function h(n) is an admissible heuristic if h(n) is always less than or equal to the actual cost of a lowest-cost path from node n to a goal.

Which of the following search strategies are considered ‘uninformed’?

Consider the following dataset including characteristics of houses and whether or not an agent was able to sell the house:   house color size      sold red large     yes red large     no gray small no gray large     yes gray small yes brown small no brown large     yes   If we were developing a naive bayes model to predict house sales, what is the prior probability for a house being sold in this case?

Consider the following dataset including characteristics of houses and whether or not an agent was able to sell the house:   house color size      sold red large     yes red large     no gray small no gray large     yes gray small yes brown small no brown large     yes   If we were developing a naive bayes model to predict house sales, would it indicate that a small red house would be sold?  

Which of the following consists of an ordered list of nodes?

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?