21⟩ How effectiveness of the alpha-beta pruning gets increased? a) Depends on the nodes b) Depends on the order in which they are executed c) Both a & b d) None of the mentioned
a) Depends on the nodes
Artificial intelligence
Home Computer Programming Artificial intelligence
“Artificial intelligence Interview Questions and Answers will guide you that Artificial intelligence (AI) is the intelligence of machines and the branch of computer science that aims to create it. Textbooks define the field as the study and design of intelligent agents, where an intelligent agent is a system that perceives its environment and takes actions that maximize its chances of success. So learn Artificial intelligence by this Artificial intelligence Interview Questions with Answers guide”
27 Artificial Intelligence Questions And Answers
22⟩ Is artificial intelligence lives over the other software programs and their flexibility?
Yes artificial intelligence Games lives over the other software programs and their flexibility.
23⟩ Which is identical to closed list in Graph search? a) Hill climbing search algorithm b) Depth-first search c) Transposition table d) None of the mentioned
c) Transposition table
24⟩ Complexity of minimax algorithm is a) Same as of DFS b) Space - bm and time - bm c) Time - bm and space - bm d) Same as BFS
a) Same as of DFS
b) Space - bm and time - bm
Explanation: Same as DFS
25⟩ Minimax algorithm (Figure 6.3) computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds. a) True b) False
a) True
Explanation: Refer definition of minimax algorithm.
26⟩ Explain AI Checkers?
The main programs here are Arthur Samuel's, the rote learning method which is a lot like a memory based method, generalization learning which is a lot like backprop and a signature table approach that also gives you a feed-forward type network. One of Samuel's programs did beat a checkers champion and the AI community has often make a fuss over that saying that this AI program played a "championship-level" game however that expert beat the program in the next 6 games. Note too, what Samuels says: "the program is quite capable of beating any amateur player and can give better players a good contest".
