Section outline


    • Students must
      Mark as done

      Lesson 13:

      Learning Objectives:

      After completing this lecture students will be able to:

      - Explain about Hill-Climbing Search

      - Explain about Local Search

      - Apply Local search on a given problem


      Slides

      Slide Lecture

    • Students must
      Mark as done

      Lesson 14:

      Learning Obectives:

      After completing this lecture students will be able to:

      • Evaluate utility funcs of some basic game playing algorithms
      • Apply greedy and minimax algorithm on some popular turn taking games
      Slide

      Slide Lecture


    • Students must
      Mark as done

      Tutorial

    • Class Recording

      Here is the link

      Not available unless: You belong to I

    • Class Recording

      Here is the link

      Not available unless: You belong to J

    • Class Recording

      Here is the link

      Not available unless: You belong to K