Home > Artificial Intelligence > Quizzes > Artificial Intelligence: Search Techniques
Artificial Intelligence: Search Techniques
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 21% • Most missed: “How many types of informed search method are in artificial intelligence?”
Artificial Intelligence: Search Techniques
Time left 00:00
25 Questions

1. A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state.
2. The initial state and the legal moves for each side define the __________ for the game.
3. What is the complexity of minimax algorithm?
4. Which function will select the lowest expansion node at first for evaluation?
5. _______________ Is an algorithm, a loop that continually moves in the direction of increasing value .
6. Zero sum game has to be a ______ game.
7. What are the two main features of Genetic Algorithm?
8. What is the domination number for 8-queen's problem?
9. Of the following given options, which one of the following is a correct option that provides an optimal solution for 4-queens problem?
10. A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum.
11. A game can be formally defined as a kind of search problem with the following components.
12. Which is used to improve the performance of heuristic search?
13. What is called as transposition table?
14. Which search method will expand the node that is closest to the goal?
15. How many parts does a problem consists of?
16. Which method is used to search better by learning?
17. Not more than 2 queens can occur in an n-queens problem.
18. General algorithm applied on game tree for making decision of win/lose is ____________
19. Adversarial search problems uses ____________
20. Which search is implemented with an empty first-in-first-out queue?
21. Which values are independant in minimax search algorithm?
22. Searching using query on Internet is, use of ___________ type of agent.
23. Mathematical game theory, a branch of economics, views any multi-agent environment as a game provided that the impact of each agent on the others is .
24. Which search algorithm imposes a fixed depth limit on nodes?
25. In many problems the path to goal is irrelevant, this class of problems can be solved using ____________

⚡ Recently practiced quizzes in this topic
Live quiz activity
Artificial Intelligence Practice Test Questions: Adversarial Search Natural Language Processing (NLP) Basics Test Soft Computing Practice Test Questions Artificial Intelligence Fundamentals: Introduction to Artificial Intelligence Practice Test CBSE Class 10 Natural Language Processing AI-417 Practice Test Artificial Intelligence Practice Test Questions: Planning and Acting in the Real World Artificial Intelligence & Soft Computing: Expert System Neural Network Practice Test: Feedforward Neural Networks Artificial Intelligence Practice Test Questions 3 Artificial Intelligence Practice Test: Uninformed Search Strategy
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | OSHA Basics Quiz | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.