Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.


Prompt: The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a green end square, and multiple red filled rectangles indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the green end square along the shortest path without entering any cells containing red filled rectangles. Only modify what the task requires; keep the background and any other element unchanged.