Artificial intelligence (AI) Questions and Answers
Download Artificial intelligence eBook

Download PDF Download Artificial intelligence Questions eBook

Artificial intelligence Questions and Answers: Submit Your Question

Q - 1 Explain AI Checkers?

Ans- 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".
Is This Answer Correct?    0 Yes 0 No
Submit Your Answer

Q - 2 Consider this: after a while Tesuaros temporal difference program will likely stop learning, so does this means that it lost its intelligence?

Ans- Some game playing programs are getting quite good and I expect that in the long run all the best "players" will be programs. While that is wonderful and while those programs that learn to play their games get a rating of minimal intelligence from me remember that what's impressive about people is that not only can they do games, they do heuristic search, theorem proving, use natural language and cope with the real world. The real challenge is to get programs to do that. If you simply pursue techniques for game playing will you ever end up with all these human capabilities in one program?
Is This Answer Correct?    0 Yes 0 No
Submit Your Answer

Q - 3 Tell me about AI Backgammon?

Ans- This section looks at Berliner's program, two backprop versions by Tesauro and a temporal difference method by Tesauro. This latter program is VERY good and has found strategies that now human backgammon players acknowledge are better than some of the old humanly devised strategies.
Is This Answer Correct?    0 Yes 0 No
Submit Your Answer

Q - 4 Is artificial intelligence lives over the other software programs and their flexibility?

Ans- Yes artificial intelligence Games lives over the other software programs and their flexibility.
Is This Answer Correct?    0 Yes 0 No
Submit Your Answer

Q - 7 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

Ans- a) Same as of DFS
b) Space - bm and time - bm
Explanation: Same as DFS
Is This Answer Correct?    0 Yes 0 No
Submit Your Answer
Ans- b) Game Tree
Explanation:
An example of game tree for Tic-Tac-Toe game.
Is This Answer Correct?    0 Yes 0 No
Submit Your Answer

Q - 10 Zero sum game has to be _______ game.
a) Single player
b) Two player
c) Multiplayer
d) Three player

Ans- c) Multiplayer
Explanation: Zero sum games could be multiplayer games as long as the condition for zero sum game is satisfied
Is This Answer Correct?    0 Yes 0 No
Submit Your Answer

Place Your Question