Q. In 1985, the famous chess player David Levy beat a world champion chess program in four straight games by using orthodox moves that confused the program. What was the name of the chess program?

View solution

Q. Which approach is to pretend that a pure divide and conquer algorithm will work?

View solution

Q. What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem?

View solution

Q. What is meant by consistent in state-space search?

View solution

Q. What is the other name of backward state-space search?

View solution

Q. What is the main advantage of backward state-space search?

View solution

Q. What is the other name for forward state-space search?

View solution

Q. How many ways are available to solve the state-space search?

View solution

Q. What are conditions taken into account of state-space search?

View solution

Q. Which is the most straightforward approach for planning algorithm?

View solution

Q. Which values are independent in minimax search algorithm?

View solution

Q. To which depth does the alpha-beta pruning can be applied?

View solution

Q. Which value is assigned to alpha and beta in the alpha-beta pruning?

View solution

Q. Where does the values of alpha-beta search get updated?

View solution

Q. What is called as transposition table?

View solution

Q. Which function is used to calculate the feasibility of whole game tree?

View solution

Q. Which is identical to the closed list in Graph search?

View solution

Q. How the effectiveness of the alpha-beta pruning gets increased?

View solution

Q. Which search is similar to minimax search?

View solution

Q. Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?

View solution