8- Puzzle Problem

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-2-artificial-intelligence/game-playing/puzzle-based-state-space-search/asset-8-puzzle-problem after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: UPPSC Course Overview
  2. Interview Preparation & Guidance: Interview Preparation
  3. Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material)
  4. Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
  5. Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  6. Paper 1 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, ORDBMS, NoSQL
  7. Paper 1 | Cyber Security: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking
  8. Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
  9. Paper 1 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  10. Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  11. Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  12. Paper 1 | Discrete Structures and Theory of Logic: Permutation and Combination, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  13. Paper 1 | Software Project Management: Software Project Management
  14. Paper 2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  15. Paper 2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  16. Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, Emerging Tech Trends
  17. Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
  18. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  19. Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  20. Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
  21. Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
  22. Paper 2 | Distributed System: Distributed Systems
  23. UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
  24. Previous Year Papers:
  25. Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video introduces the 8-puzzle problem as a search problem in artificial intelligence, defining its components: states, initial state, actions, transition model, and goal test. It presents a 3x3 grid with eight numbered tiles and one blank space, where tiles slide into the adjacent empty space. A question is posed asking which of four given states cannot be reached from an initial state, illustrating the concept of solvability. The scene transitions to a 3-puzzle example with tiles labeled 1, 2, and 3, where the instructor uses handwritten annotations to highlight moves like 'Up' and 'Down', and marks one state as 'Invalid State'. The video presents a 3-puzzle problem analogous to the 8-puzzle, where tiles can only move into an adjacent empty space. The question asks which of the given states cannot be reached from the initial configuration, focusing on reachability based on puzzle rules. On-screen text includes: 'Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space.' The initial state is shown with tiles 1,2,3 and an empty space. Options (A), (B), (C), and (D) are displayed, with option (D) labeled as 'Invalid state' by hand. The instructor uses handwritten annotations to highlight key moves and invalid states, guiding the viewer through logical deduction.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video introduces the 8-puzzle problem as a search problem in artificial intelligence, defining its components: states, initial state, actions, transition model, and goal test. It presents a 3x3 grid with eight numbered tiles and one blank space, where tiles can slide into the adjacent empty space. The lesson includes a question asking which of four given states cannot be reached from an initial state, illustrating the concept of solvability. The instructor uses handwritten annotations to highlight key moves like 'Up', 'Down', and labels one option as 'Invalid State'. The question remains on screen throughout, focusing on reachability based on puzzle rules. A key teaching cue is the handwritten 'Invalid State' label next to option (D), indicating that this configuration cannot be reached from the initial state due to puzzle constraints.

  2. 2:00 – 3:22 02:00-03:22

    The video presents a 3-puzzle problem where tiles can only move into an adjacent empty space, analogous to the 8-puzzle. The question asks which of four given states cannot be reached from the initial configuration, with options (A) through (D) displayed. The instructor uses handwritten annotations to highlight movement directions—Up, Down, Left—and labels option (D) as an 'Invalid state' with a checkmark. The on-screen text explicitly states, 'which of the following state cannot be reached?' and emphasizes that a tile can only move to an adjacent empty space. The instructor analyzes the reachability of each state, using logical deduction based on valid moves, and identifies (D) as unreachable due to parity or configuration constraints. The visual focus remains on the puzzle states and annotations, with no additional context beyond the problem setup.

The lesson introduces the 8-puzzle as a search problem, defining its components and presenting a solvability question. It transitions to a 3-puzzle example where tiles move only into adjacent empty spaces, with on-screen text stating: 'Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space.' The initial state shows tiles 1,2,3 and a blank. Options (A), (B), (C), and (D) are displayed, with option (D) labeled 'Invalid state' by hand. The instructor uses handwritten annotations to highlight valid moves ('Up', 'Down') and identifies (D) as unreachable. The teaching progression focuses on reachability based on movement rules, using logical deduction to determine which configurations are impossible.

Loading lesson…