Computer Science · Artificial Intelligence
असीमित स्थिति स्थान (unbounded state space) में कौन सी सर्च विधि अनंत पथ में गहरी और गहरी जा सकती है तथा समाधान तक नहीं पहुँच सकती है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1ब्रेड्थ-फर्स्ट सर्च (BFS)
- 2डेप्थ-फर्स्ट सर्च (DFS)✓
- 3AO* खोज
- 4A* खोज
सही उत्तर देखें
डेप्थ-फर्स्ट सर्च (DFS)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Preparing for Computer Science?
Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Artificial Intelligence MCQs →Want more practice questions on Artificial Intelligence?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Artificial Intelligence