الخطوط العريضة للقسم

    • 02_Uninformed Search ملف
      ينبغي للطلبة
      التأشير بأنه منجز
    • Lecture_04 رابط الكتروني

      1. Search (States & nodes)
      2. Strategies are evaluated along the following dimensions:

        • completeness: does it always find a solution if one exists?
        • time complexity: number of nodes generated
        • space complexity: maximum number of nodes in memory
        • optimality: does it always find a least-cost solution?

    • Lecture_05 رابط الكتروني

      Solving problems by searching:

      1. Depth First Search
      2. Depth-limited search
      3. Iterative deepening search
    • Lecture_06 رابط الكتروني
      ينبغي للطلبة
      التأشير بأنه منجز

      Solving problems by searching:

      1. -Breadth-First Search
      2. -Uniform Cost Search
      3. -Bidirectional search