# AETHER 5×5 — FULL OPENING TREE (FIRST 3–4 MOVES)

## Legend

* `→` move to empty cell
* `×` merge
* `[A,B]` → resulting token
* `!` strong move, `?` mistake
* `!!` brilliant, `??` losing

***

## Root — Start Position

* All cells filled according to `(row+col) mod 5`
* First player to move: **White**

***

### 1. Main Branch: Neutral Expansion (Safe)

1. **C3→D5** (neutral, flexible) 1... B2→C4 (neutral, preserves symmetry)

#### 1.1 White: D5→B4

* **Comment:** Positioning token for future safe merge 1... C4→E3
* **Comment:** Black mirrors or maintains distance

**1.1.1 White: B4×A2 → \[A,B]**

* Safe 2-set 1... D3→C5 (neutral)
* **Refutation:** B3→C3? exposes token to early merge

**1.1.1.1 White: \[A,B]→C4**

* **Comment:** Prepare multi-threat 1... E3→D5

**1.1.1.1.1 White: C4×B2 → \[A,B,C]**

* **Refutation Line:** B2→C3? gives tempo to White
* **Evaluation:** Safe multi-threat setup; next moves win

***

### 2. Aggressive Early Merge

1. **C3×D5 → \[A,B]** 1... B2→C4 ? (mistake: allows tempo loss)

#### 2.1 White: \[A,B]×E4 → \[A,B,C]

* **Comment:** Exploit opponent’s mistake 1... A2→B4

#### 2.1.1 White: \[A,B,C]×D3 → \[A,B,C,D] → WIN

* **Comment:** Greedy but works because opponent ignored isolation

***

### 3. Mirror / Symmetry Play

1. **C3→D5** 1... C4→D4

#### 3.1 White: D5→E3

1... D4→C2

#### 3.1.1 White: E3→D1

1... C2→E5

#### 3.1.1.1 White: D1→B3

1... E5→B2

* **Result:** Draw
* **Comment:** Perfect symmetry neutralizes advantage; no unsafe merges

***

### 4. Controlled Merge (Safe Aggressive)

1. **D5→B4** 1... C3→D5

#### 4.1 White: B4→C2

1... D5→B3

**4.1.1 White: C2×B2 → \[A,B]**

* **Comment:** Safe 2-set 1... B3→C1

**4.1.1.1 White: \[A,B]→D2**

1... C1→E3

**4.1.1.1.1 White: D2×C4 → \[A,B,C]**

1... E3→D1

**4.1.1.1.1.1 White: \[A,B,C]→B5 → WIN**

* **Comment:** Isolation ensures final safe merge

***

### 5. Early Greedy / Punishable Line

1. **C3×D5 → \[A,B]** 1... B2→C4 ?

#### 5.1 White: \[A,B]×E4 → \[A,B,C]

* **Comment:** Exploit tempo advantage 1... A2→B4

#### 5.1.1 White: \[A,B,C]×D3 → \[A,B,C,D] → WIN

* **Lesson:** Greedy early merges by first player punished; timing is key

***

### Notes on Tree Expansion

* Each branch splits into **safe / unsafe** moves
* Refutations are highlighted with `?`
* Winning sequences often involve:
  * Safe initial 2-set
  * Multi-threat 3-set formation
  * Control of last type to force WIN
* Draw lines usually involve **mirror play** or maintaining symmetry

***

### Suggested Reading of Tree

* Branch 1 → teaches **positional expansion**
* Branch 2 → teaches **punishing opponent mistakes**
* Branch 3 → teaches **defensive mirror / draw tactics**
* Branch 4 → teaches **controlled aggressive merges**
* Branch 5 → teaches **how early greed is punished**

***


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://nautilus-3.gitbook.io/subit64/aether-tour/docs/opening-tree-5kh5.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.