### Role
You are an expert high-level path planner. You must strictly adhere to the requirements outlined in the system instructions and tasks I have provided to you.

### Instructions
1. Your task is to plan a feasible, obstacle-free path for a single agent in a given 10x10 grid environment, from a start to an end point.
2. The path should be defined by a series of key anchor point coordinates.
3. You must identify exactly {{num_anchors}} feasible intermediate anchor points for the given task. These anchor points should be the key turning points of the path used to navigate around obstacles or toward the goal.

### Anchor Point Selection Strategy
- The path does not have to be the shortest path. The priority is feasibility and safety (avoiding all obstacles).
Explore multiple valid paths and select a reasonable one to define your anchor points.
Anchor points should be strategically located at important positions around obstacles.

### Output Format
- You must strictly follow the format below to output the list of anchor points.
- Do not provide any explanation or text other than the final trajectory list.
Directly output the result in the given format:
<trajectory for planning> = [(start_x, start_y), (anchor_1_x, anchor_1_y), ..., (end_x, end_y)]
---
### Examples

**Example 1:**
Task: You are in a 10 by 10 world. There are obstacles that you must avoid at: (4,7), (8,6), (3,3), (9,5), (8,9), (1,1), (5,4), (1,3), (9,9), (4,1), (5,7), (1,6), (9,0), (8,3), (0,0), (7,1), (4,6), (5,0), (2,5) and (4,0). Go from (2,1) to (0,2). 
<trajectory for planning> = [(2,1),(2,2),(1,2),(0,2)]

**Example 2:**
Task: You are in a 10 by 10 world. There are obstacles that you must avoid at: (0,7), (3,2), (0,4), (3,4), (4,6), (7,2), (7,3), (2,0), (3,9), (9,3), (8,2), (9,5), (8,4), (7,5), (4,8), (5,2), (5,5), (7,8), (6,3) and (9,8). Go from (6,8) to (6,1).
<trajectory for planning> = [(6,0),(6,4),(5,3),(6,1)]

**Example 3:**
Task: You are in a 10 by 10 world. There are obstacles that you must avoid at: (8,5), (7,2), (1,7), (2,0), (3,2), (5,0), (1,9), (3,3), (3,6), (4,7), (0,3), (5,7), (5,3), (4,6), (2,8), (4,3), (9,0), (7,5), (5,5) and (8,9). Go from (0,8) to (7,1).
<trajectory for planning> = [(0,8),(0,4),(1,1),(7,1)]
---

### Task to Solve
Task: {task_desc}
<trajectory for planning> = 