## Prompt Template: Maze Navigation Task ### Overview The image presents a prompt template for a problem-solving task involving navigating a maze. It includes a task description, reasoning guidance, problem facts, examples of input and output formats, and key constraints. The goal is to help Bob navigate a maze to rescue Alice, following specific rules about room connections and door locks. ### Components/Axes * **Task Description** (Left side, top): Provides the problem statement, maze description, valid actions, action syntax, and key constraints. * **Reasoning Guidance** (Right side, top): Outlines the steps to complete the task, including finding the shortest path, identifying locked doors, planning key collection, and tracking actions. * **Problem Facts** (Right side, bottom): Lists the specific facts about the maze, including room connections, locked doors, key locations, and the starting and target locations. * **Examples** (Left side, bottom): Provides input and output examples to illustrate the expected format and solution. ### Detailed Analysis or ### Content Details **Task Description:** * **Problem:** Help Bob navigate a maze of connected rooms to rescue Alice. * **Maze Description:** Includes room connections (open, locked, closed doors), door information, key information, starting location (Bob), and target location (Alice). * **Valid Actions:** start, move\_to, pick\_up\_key, use\_key, unlock\_and\_open\_door\_to, rescue. * **Action Syntax:** Room IDs (Column-Row, e.g., 'A1'), Key IDs (positive integers, e.g., '1'). * **Key Constraints:** 1. Each move must be between adjacent and connected rooms. 2. Keys must be picked up before use. 3. Locked doors require use of their specific key to unlock. 4. Optimal path minimizes actions/distance. 5. use\_key action always comes right before unlock\_and\_open\_door\_to. 6. If the response is missing any intermediate action it is invalid. * **Output Format:** Python list of tuples: \[('start', 'RoomID'), ('move\_to', 'RoomID'), ('pick\_up\_key', 'KeyID'), ...]. Example: \[('start', 'A1'), ('move\_to', 'B1'), ('pick\_up\_key', '3'), ('use\_key', '3'), ('unlock\_and\_open\_door\_to', 'C1'), ('rescue', 'Alice')]. **Reasoning Guidance:** * Steps to complete the task: 1. Find the shortest path from Bob to Alice. 2. Identify any locked doors on this path. 3. For each locked door, find its required key. 4. Plan key collection order to ensure you have each key before reaching its door. 5. Track all actions while following the rules. 6. Avoid unnecessary steps that increase the total path length. * If the path seems complex: Break it into smaller segments, solve each segment separately, combine the solutions while maintaining optimality, remember to think step by step and verify each move, proceed to provide your solution as a list of tuples in chronological order. **Problem Facts:** * Room A6 and A5 are connected by an open door. * Room A6 and B6 are connected by an open door. * Room B6 and C6 are connected by an open door. * Room C6 and D6 are connected by an open door. * Room C5 and C4 are connected by an open door. * Room C4 and D4 are connected by an open door. * Room D6 and D5 are connected by a closed and locked door. The locked door between D6 and D5 requires key 10. * Key 10 is in room A5. * Room D6 and E6 are connected by an open door. * Room D5 and D4 are connected by an open door. * Room E6 and F6 are connected by an open door. * Room A4 and A3 are connected by an open door. * Bob is in room F6. * Alice is in room C5. **Examples:** * **Input Facts:** * Room C4 and C3 are connected by an open door. * Room C3 and D3 are connected by an open door. * Room D5 and E5 are connected by an open door. * Room A2 and A1 are connected by an open door. * Room A3 and B3 are connected by an open door. * Room A1 and B1 are connected by an open door. * Room A4 and A3 are connected by an open door. * Room E5 and E4 are connected by an open door. * Room D4 and D3 are connected by an open door. * Room A5 and B5 are connected by an open door. * Room D4 and E4 are connected by an open door. * Bob is in room D5. * Alice is in room C4. * **Output:** \[('start', 'D5'), ('move\_to', 'E5'), ('move\_to', 'E4'), ('move\_to', 'D4'), ('move\_to', 'D3'), ('move\_to', 'C3'), ('move\_to', 'C4'), ('rescue', 'Alice')]. ### Key Observations * The task requires a structured approach to problem-solving, emphasizing step-by-step reasoning and adherence to specific rules. * The output format is strictly defined as a Python list of tuples, indicating a computational or programmatic context. * The problem facts provide a limited scope of information, suggesting that the solution should rely solely on the given data. ### Interpretation The prompt template is designed to guide a problem-solving agent (likely an AI or a human) through a maze navigation task. The task is framed as a rescue mission, adding a narrative element. The structured format and constraints suggest an environment where precision and adherence to rules are critical. The inclusion of input and output examples serves to clarify the expected behavior and format of the solution. The problem facts provide the necessary information to solve the maze, but the agent must use the reasoning guidance to determine the optimal path and actions. The task is likely intended to test the agent's ability to understand and apply rules, plan a sequence of actions, and format the output correctly.

## Document Type: Prompt Template ### Overview This image presents a "Prompt Template" designed to guide a problem-solving agent through a maze navigation task. It outlines the task description, provides reasoning guidance, includes an example input/output, and presents a new problem for the agent to solve. The document is structured into distinct sections to clearly convey instructions, constraints, and expected output format. ### Components/Axes The document is laid out with a main title at the top and four distinct content panels arranged in a 2x2 grid, with two panels on the left and two on the right. Each of the four main content panels has a vertical, rotated label on its outer side. * **Header (Top-Center):** "Prompt Template" * **Left Column, Top Panel:** Labeled "Task Description" (rotated vertically on the left edge). This panel contains the core problem statement, maze details, valid actions, syntax, constraints, and output format requirements. * **Right Column, Top Panel:** Labeled "Reasoning Guidance" (rotated vertically on the right edge). This panel provides a step-by-step approach and advice for solving the task. * **Left Column, Bottom Panel:** Labeled "Examples" (rotated vertically on the left edge). This panel provides a concrete example of input facts and the corresponding expected output. * **Right Column, Bottom Panel:** Labeled "Problem Facts" (rotated vertically on the right edge). This panel presents a new set of facts for a specific problem instance, followed by a placeholder for "YOUR SOLUTION". ### Detailed Analysis The document is composed entirely of text, structured into logical sections. **Top-Left Panel: Task Description** * **Introductory Statement:** "You are a problem solving agent that thinks carefully step by step based on provided facts and follows instructions closely." * **TASK:** "Help Bob navigate through a maze of connected rooms to rescue Alice. Bob starts in a specified room and needs to find the optimal path to reach Alice's location, following the maze's rules about room connections and door locks." * **MAZE DESCRIPTION CONTAINS:** 1. "Room connections (which rooms are connected to each other by open or locked and closed doors)" 2. "Door information (open or locked)" 3. "Key information (where they are located and which doors they unlock)" 4. "Starting location: Where Bob is at the start" 5. "Target location: Where Alice is at the start - Where Bob needs to get to to complete the rescue" * **Valid actions:** "start, move_to, pick_up_key, use_key, unlock_and_open_door_to, rescue" * **Action & parameter syntax:** * "Room IDs: Column-Row (e.g., 'A1')" * "Key IDs: positive integers (e.g., '1')" * "start/move_to: room ID" * "pick_up_key/use_key: key ID" * "unlock_and_open_door_to: room ID" * "rescue: 'Alice'" * **KEY CONSTRAINTS:** 1. "Each move must be between adjacent and connected rooms" 2. "Keys must be picked up before use" 3. "Locked doors require use of their specific key to unlock" 4. "Optimal path minimizes actions/distance" 5. "use_key action always come right before unlock_and_open_door_to" 6. "If the response is missing any intermediate action it is invalid - so it should include all the details necessary IMPORTANT: Use only provided IDs." * **OUTPUT FORMAT REQUIREMENT:** * "Your solution must be formatted as a Python list of tuples representing each action in chronological order:" * "[('start', 'RoomID'), ('move_to', 'RoomID'), ('pick_up_key', 'KeyID'), ...]" * "Example format: [('start', 'A1'), ('move_to', 'B1'), ('pick_up_key', '3'), ('use_key', '3'), ('unlock_and_open_door_to', 'C1'), ('rescue', 'Alice')]" **Top-Right Panel: Reasoning Guidance** * **TO COMPLETE THIS TASK FOLLOW THESE STEPS:** 1. "Find the shortest path from Bob to Alice." 2. "Identify any locked doors on this path." 3. "For each locked door, find its required key." 4. "Plan key collection order to ensure you have each key before reaching its door." 5. "Track all actions while following the rules" 6. "Avoid unnecessary steps that increase the total path length." * **IF THE PATH SEEMS COMPLEX:** * "- Break it into smaller segments" * "- Solve each segment separately," * "- Combine the solutions while maintaining optimality" * "Remember to think step by step and verify each move." * "Proceed to provide your solution as a list of tuples in chronological order." **Bottom-Left Panel: Examples** * **EXAMPLES:** * **INPUT:** * **FACTS:** "Room C4 and C3 are connected by an open door. Room C3 and D3 are connected by an open door. Room D5 and E5 are connected by an open door. Room A2 and A1 are connected by an open door. Room A3 and B3 are connected by an open door. Room A1 and B1 are connected by an open door. Room A4 and A3 are connected by an open door. Room E5 and E4 are connected by an open door. Room D4 and D3 are connected by an open door. Room A5 and B5 are connected by an open door. Room D4 and E4 are connected by an open door. Bob is in room D5. Alice is in room C4." * **OUTPUT:** * "[('start', 'D5'), ('move_to', 'E5'), ('move_to', 'E4'), ('move_to', 'D4'), ('move_to', 'D3'), ('move_to', 'C3'), ('move_to', 'C4'), ('rescue', 'Alice')]" * "END OF EXAMPLES" **Bottom-Right Panel: Problem Facts** * **PROBLEM:** * **FACTS:** "Room A6 and A5 are connected by an open door. Room A6 and B6 are connected by an open door. Room B6 and C6 are connected by an open door. Room C6 and D6 are connected by an open door. Room C5 and C4 are connected by an open door. Room C4 and D4 are connected by an open door. Room D6 and D5 are connected by a closed and locked door. The locked door between D6 and D5 requires key 10. Key 10 is in room A5. Room D6 and E6 are connected by an open door. Room D5 and D4 are connected by an open door. Room E6 and F6 are connected by an open door. Room A4 and A3 are connected by an open door. Bob is in room F6. Alice is in room C5." * **YOUR SOLUTION:** (This area is blank, awaiting a solution) ### Key Observations * The document is a comprehensive instruction set for a pathfinding and object interaction problem within a maze environment. * It explicitly defines the agent's role, the task, the maze's components, valid actions, their syntax, and critical constraints. * The output format is strictly defined as a Python list of tuples, with an example provided for clarity. * Reasoning guidance emphasizes optimality, step-by-step thinking, and handling complexity by segmentation. * The "Examples" section serves as a clear demonstration of the expected input and output, which is crucial for understanding the task. * The "Problem Facts" section presents a new, unsolved instance of the problem, indicating that the document is a template for a task to be completed. * Room IDs use a "Column-Row" format (e.g., 'A1'), and Key IDs are positive integers. ### Interpretation This "Prompt Template" is designed to elicit a structured, optimal solution from a problem-solving agent (likely an AI or a human programmer) for a complex maze navigation and key-collection task. The detailed instructions, constraints, and reasoning guidance aim to ensure that the agent understands the problem thoroughly and produces a solution that adheres to all rules and formatting requirements. The problem itself is a variation of a shortest path problem, complicated by the introduction of locked doors and keys. The agent must not only find a path but also strategically collect keys to unlock necessary doors, all while minimizing the total number of actions. The emphasis on "optimal path" and "minimizes actions/distance" suggests that efficiency is a primary concern. The inclusion of an example is critical for clarifying the expected behavior and output format, especially for the Python list of tuples. The "Reasoning Guidance" acts as a meta-instruction, guiding the thought process rather than just the task itself, which is particularly useful for complex AI tasks where the agent needs to demonstrate logical reasoning. The document effectively segments the information into digestible parts: what to do, how to think about it, an illustration, and a new challenge. This structure facilitates a clear understanding of the problem and the expectations for the solution, making it a robust template for evaluating problem-solving capabilities in a constrained environment.

\n ## Diagram: Maze Solving Agent Prompt Template ### Overview The image presents a diagram outlining a prompt template for a problem-solving agent tasked with navigating a maze. The diagram is structured as a flowchart, visually representing the steps and considerations for the agent's reasoning process. It's divided into sections labeled "Task Description", "Reasoning Guidance", "Problem Facts", and "Example Responses". ### Components/Axes The diagram is not a chart with axes, but a structured flowchart. Key components include: * **Task Description:** Outlines the agent's goal – to find the optimal path through a maze. * **Reasoning Guidance:** Lists steps the agent should follow (1-6). * **Problem Facts:** Provides specific details about the maze (room connections, door states). * **Example Responses:** Shows the expected format of the agent's solution. * **Labels:** Numerous labels describing actions, constraints, and components. * **Flow Arrows:** Indicate the sequence of steps and dependencies. ### Detailed Analysis or Content Details **Task Description:** * **TASK:** Help Bob navigate a maze of connected rooms to rescue Alice. * **MAZE DESCRIPTION CONTAINS:** Room connections (open/closed doors), door information (lock/unlock keys), starting location (Where Bob is at the start), target location (Where Alice is at the start). * **Valid actions:** start, move_to, pick_up, use_key, unlock, open_door, to_rescue * **Action & parameter syntax:** Room IDs: Column-Row (e.g., "A1"). Key IDs: positive integers (e.g., "1"). * **Task Constraints:** 1. Each move must be between adjacent and connected rooms. 2. Keys must be picked up before use. 3. Locked doors require use of their specific key to unlock. 4. Optimal path minimizes actions/distance. 5. Actions must be in correct order (move, unlock, open_door). * **OUTPUT FORMAT REQUIREMENT:** A Python list of tuples representing each action in chronological order: `[('start', 'RoomID'), ('move_to', 'RoomID'), ...]` **Reasoning Guidance (Steps):** 1. Find the shortest path from Bob to Alice. 2. Identify any locked doors on this path. 3. For each locked door, find its required key. 4. Plan key collection order to ensure you have each key before reaching its door. 5. Track all actions while following the rules. 6. Avoid unnecessary actions that increase the total path length. * **IF THE PATH SEEMS COMPLEX:** Break it into smaller segments, solve each segment separately, combine solutions while maintaining optimality. **Problem Facts:** * **PROBLEM:** Room A6 and A5 are connected by an open door. Room A6 and B6 are connected by an open door. Room B6 and C6 are connected by an open door. Room C6 and D6 are connected by an open door. Room D6 and E6 are connected by an open door. Room E6 and F6 are connected by an open door. Room F6 and G6 are connected by an open door. Room G6 and H6 are connected by an open door. Room H6 and I6 are connected by an open door. Room D5 and C4 are connected by a locked door. The locked door requires key 10. Room A5 and B5 are connected by a locked door. The locked door requires key 1. Room B5 and C5 are connected by an open door. Room C5 and D5 are connected by an open door. Room D4 and C4 are connected by a locked door. The locked door requires key 7. Room A1 is where Bob starts. Room I6 is where Alice is at the start. **Example Responses:** * **Your solution must be formatted as a Python list of tuples representing each action in chronological order:** `[('start', 'A1'), ('move_to', 'A5'), ('pick_up', '1'), ('unlock', '1'), ...]` ### Key Observations The diagram is highly structured and detailed, providing a comprehensive framework for the agent's task. The emphasis on constraints and output format suggests a need for precise and well-defined solutions. The inclusion of a complex path scenario highlights the importance of efficient planning and key management. ### Interpretation This diagram serves as a blueprint for a maze-solving AI agent. It's not presenting data *about* a maze, but rather *instructions* for an agent *to solve* a maze. The diagram's strength lies in its explicit breakdown of the problem into manageable steps, emphasizing logical reasoning and adherence to constraints. The inclusion of example output demonstrates the desired level of precision and formality. The "Reasoning Guidance" section is particularly important, as it outlines the cognitive processes the agent should employ. The "Problem Facts" section provides a concrete scenario for testing the agent's capabilities. The diagram is a clear example of how to translate a complex problem into a structured, solvable format for an AI agent. It's a design document for an AI system, not a data visualization.

## Diagram: Prompt Template for Maze Navigation Problem ### Overview The image displays a structured "Prompt Template" designed to instruct an AI agent on solving a maze navigation problem. The template is organized into four distinct, color-coded sections, each with a specific role in defining the task, providing examples, offering reasoning guidance, and presenting the problem facts. The overall purpose is to guide an agent to find the shortest path for "Bob" to rescue "Alice" in a maze of connected rooms with locked doors and keys. ### Components/Axes The diagram is segmented into four primary rectangular boxes, each with a vertical label on its left or right side. 1. **Task Description (Left, Pink Box):** * **Label:** "Task Description" (vertical text on the left). * **Content:** Defines the agent's role, the core task, the structure of the maze description, valid actions, key constraints, and the required output format. 2. **Examples (Bottom-Left, Green Box):** * **Label:** "Examples" (vertical text on the left). * **Content:** Provides a complete example input (FACTS) and the corresponding correct output (a Python list of action tuples). 3. **Reasoning Guidance (Top-Right, Light Blue Box):** * **Label:** "Reasoning Guidance" (vertical text on the right). * **Content:** Lists a step-by-step procedure for the agent to follow to complete the task, including strategies for handling complexity. 4. **Problem Facts (Bottom-Right, Yellow Box):** * **Label:** "Problem Facts" (vertical text on the right). * **Content:** Presents the specific maze configuration for the current problem, including room connections, door states, key locations, and the start/end points. ### Detailed Analysis / Content Details **1. Task Description Box Content:** * **Agent Role:** "You are a problem solving agent that thinks carefully step by step based on provided facts and follows instructions closely." * **TASK:** "Help Bob navigate through a maze of connected rooms to rescue Alice. Bob starts in a specified room and needs to find the optimal path to reach Alice's location, following the maze's rules about room connections and door locks." * **MAZE DESCRIPTION CONTAINS:** 1. Room connections (open or locked/closed doors). 2. Door information (open or locked). 3. Key information (location and which doors they unlock). 4. Starting location (Bob's start). 5. Target location (Alice's location). * **Valid actions:** `start`, `move_to`, `pick_up_key`, `use_key`, `unlock_and_open_door_to`, `rescue`. * **Action & parameter syntax:** * Room IDs: Column-Row (e.g., 'A1'). * Key IDs: positive integers (e.g., '1'). * `start`/`move_to`: room ID. * `pick_up_key`/`use_key`: key ID. * `unlock_and_open_door_to`: room ID. * `rescue`: 'Alice'. * **KEY CONSTRAINTS:** 1. Each move must be between adjacent and connected rooms. 2. Keys must be picked up before use. 3. Locked doors require use of their specific key to unlock. 4. Optimal path minimizes actions/distance. 5. `use_key` action always comes right before `unlock_and_open_door_to`. 6. If the response is missing any intermediate action it is invalid. * **IMPORTANT:** Use only provided IDs. * **OUTPUT FORMAT REQUIREMENT:** "Your solution must be formatted as a Python list of tuples representing each action in chronological order." * Example format: `[('start', 'A1'), ('move_to', 'B1'), ('pick_up_key', '3'), ('use_key', '3'), ('unlock_and_open_door_to', 'C1'), ('rescue', 'Alice')]` **2. Examples Box Content:** * **INPUT (FACTS):** * Room C4 and C3 are connected by an open door. * Room C3 and D3 are connected by an open door. * Room D5 and E5 are connected by an open door. * Room A2 and A1 are connected by an open door. * Room A3 and B3 are connected by an open door. * Room A1 and B1 are connected by an open door. * Room A4 and A3 are connected by an open door. * Room E5 and E4 are connected by an open door. * Room D4 and D3 are connected by an open door. * Room A5 and B5 are connected by an open door. * Room D4 and E4 are connected by an open door. * Bob is in room D5. * Alice is in room C4. * **OUTPUT:** `[('start', 'D5'), ('move_to', 'E5'), ('move_to', 'E4'), ('move_to', 'D4'), ('move_to', 'D3'), ('move_to', 'C3'), ('move_to', 'C4'), ('rescue', 'Alice')]` **3. Reasoning Guidance Box Content:** * **TO COMPLETE THIS TASK FOLLOW THESE STEPS:** 1. Find the shortest path from Bob to Alice. 2. Identify any locked doors on this path. 3. For each locked door, find its required key. 4. Plan key collection order to ensure you have each key before reaching its door. 5. Track all actions while following the rules. 6. Avoid unnecessary steps that increase the total path length. * **IF THE PATH SEEMS COMPLEX:** * Break it into smaller segments. * Solve each segment separately. * Combine the solutions while maintaining optimality. * **Remember** to think step by step and verify each move. * **Proceed** to provide your solution as a list of tuples in chronological order. **4. Problem Facts Box Content (The Current Problem):** * **FACTS:** * Room A6 and A5 are connected by an open door. * Room A6 and B6 are connected by an open door. * Room B6 and C6 are connected by an open door. * Room C6 and D6 are connected by an open door. * Room C5 and C4 are connected by an open door. * Room C4 and D4 are connected by an open door. * Room D6 and D5 are connected by a closed and locked door. * The locked door between D6 and D5 requires key 10. * Key 10 is in room A5. * Room D6 and E6 are connected by an open door. * Room D5 and D4 are connected by an open door. * Room E6 and F6 are connected by an open door. * Room A4 and A3 are connected by an open door. * Bob is in room F6. * Alice is in room C5. * **YOUR SOLUTION:** [This section is blank, intended for the agent's output.] ### Key Observations * **Structured Input:** The template enforces a strict separation between the general task rules (Task Description), illustrative examples, problem-solving heuristics (Reasoning Guidance), and the specific problem instance (Problem Facts). * **Critical Constraint:** The `use_key` action must immediately precede the `unlock_and_open_door_to` action for the same key/door pair. * **Optimality Requirement:** The solution must be the shortest path, minimizing both actions and distance. * **Output Rigor:** The solution must be a complete, chronological list of action tuples with no missing intermediate steps. * **Problem Specifics:** In the given problem, Bob starts at F6 and Alice is at C5. The primary obstacle is a locked door between D6 and D5, which requires Key 10 located in room A5. The agent must plan a route from F6 to A5 to collect the key, then to the D6-D5 door to unlock it, and finally to C5. ### Interpretation This prompt template is a sophisticated framework for testing or deploying an AI agent's planning and reasoning capabilities in a constrained, symbolic environment. It moves beyond a simple problem statement by embedding: 1. **Meta-Cognition:** The "Reasoning Guidance" section explicitly instructs the agent on *how* to think (break down problems, verify steps), promoting robust chain-of-thought reasoning. 2. **Few-Shot Learning:** The "Examples" section provides a clear demonstration of the expected input-output mapping, reducing ambiguity in the output format. 3. **Formalized Action Space:** By defining precise action syntax and constraints, it creates a verifiable and deterministic environment for the agent's operations. 4. **Hierarchical Problem Decomposition:** The structure encourages the agent to first understand the general rules, then see an example, then adopt a solving strategy, and finally apply all of this to the specific facts. This mirrors effective human problem-solving pedagogy. The template's design suggests it is intended for evaluating or training AI systems on tasks requiring spatial reasoning, sequential planning, and strict adherence to procedural rules. The inclusion of locked doors and keys adds a layer of dependency management, making the problem non-trivial and requiring look-ahead planning.

## Screenshot: Prompt Template for Maze Navigation Task ### Overview The image displays a structured prompt template divided into three sections: **Task Description**, **Reasoning Guidance**, and **Problem**. It outlines a maze navigation problem where an agent (Bob) must rescue Alice by navigating connected rooms, using keys to unlock doors, and following constraints to find the optimal path. --- ### Components/Axes #### Task Description - **Task**: Help Bob navigate a maze of connected rooms to rescue Alice. - **Maze Description**: - Room connections (open/locked/closed doors). - Door information (location, open/locked status). - Key information (location, door unlock capability). - Starting location (Bob's start room). - Target location (Alice's room). - **Valid Actions**: - `start`, `move_to`, `pick_up_key`, `use_key`, `unlock_and_open_door_to`, `rescue`. - **Action & Parameter Syntax**: - Room IDs: Column-Row (e.g., 'A1'). - Key IDs: Positive integers (e.g., '1'). - Example: `('move_to', 'B1')`. - **Key Constraints**: 1. Moves must be between adjacent, connected rooms. 2. Keys must be picked up before use. 3. Optimal path minimizes actions/distance. 4. `use_key` action invalidates the key. - **Output Format**: Python list of tuples (chronological actions). - **Examples**: - Input: Room connections, Bob in D5, Alice in C4. - Output: Sequence of actions to reach Alice. #### Reasoning Guidance - **Steps to Complete Task**: 1. Find the shortest path from Bob to Alice. 2. Identify locked doors on the path. 3. For each locked door, find its required key. 4. Plan key collection order to ensure keys are available before reaching doors. 5. Track all actions while following rules. 6. Avoid unnecessary steps increasing path length. - **Complex Path Handling**: - Break into smaller segments. - Solve each segment separately. - Combine solutions while maintaining optimality. #### Problem - **Facts**: - Room connections (e.g., A6-A5: open door; C6-D6: open door; D4-D5: closed/locked door requiring key 10). - Key locations (e.g., key 10 in A5). - Bob starts in F6; Alice is in C5. - **Solution**: Not provided (to be derived by the agent). --- ### Detailed Analysis #### Task Description - **Room Connections**: Defined by open/locked/closed doors (e.g., C4-C3: open door; D4-D5: closed/locked door). - **Key Usage**: Keys must be picked up before use and become invalid after use. - **Output Example**: Chronological action list (e.g., `[('start', 'D5'), ('move_to', 'E5'), ...]`). #### Reasoning Guidance - **Optimality**: Emphasizes minimizing actions/distance and avoiding redundant steps. - **Key Collection**: Requires planning to ensure keys are available before reaching locked doors. #### Problem - **Maze Complexity**: Includes both open and locked doors, with keys scattered across rooms. - **Critical Path**: Bob must navigate from F6 to C5, unlocking doors (e.g., D4-D5) using key 10 from A5. --- ### Key Observations 1. **Action Constraints**: Keys are single-use and must be collected before use. 2. **Path Optimization**: The solution must balance shortest distance with key acquisition. 3. **Locked Doors**: Require specific keys (e.g., key 10 for D4-D5), adding complexity to pathfinding. --- ### Interpretation The template simulates a constrained pathfinding problem with resource management (keys). The agent must: - Prioritize key collection to unlock critical doors. - Avoid paths that require backtracking or redundant actions. - Ensure keys are used before they become invalid. This structure mirrors real-world scenarios like logistics or escape room puzzles, where resource allocation and path optimization are critical. The absence of a provided solution forces the agent to apply logical reasoning and constraint satisfaction to derive the correct sequence of actions.