Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Starting at the green cell, visit all yellow numbered cells in numerical order, then reach the red endpoint. Only cardinal directions allowed. Minimize total path length. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Navigate from the green start cell to the red end cell, visiting the yellow numbered cells in ascending order (1, 2, 3, ...). Use only horizontal and vertical movements (no diagonal). Find the shortest path between consecutive targets. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: Guide the agent from green to red, passing through yellow numbers in sequence (1→2→3→...). Move only up, down, left, or right. Optimize the path length between each pair of consecutive waypoints. Only modify what the task requires; keep the background and any other element unchanged.