Star Battle Strategy: Solve Any Grid with Pure Logic

A Star Battle puzzle consists of a grid divided into outlined regions (like a jigsaw puzzle). Your goal is to place exactly two stars in every row, every column, and every region. The critical adjacency rule states that no two stars may touch each other, not even diagonally. This means every star must have an empty ring of 8 cells around it (fewer at edges and corners). The adjacency rule is the defining constraint of Star Battle and is responsible for most of the puzzle's depth. A star placed in the center of the grid eliminates 9 cells (itself plus its 8 neighbors) from further star placement. This aggressive elimination means that each star you place provides enormous information about where other stars can and cannot go. A standard Star Battle grid is 10x10 with 10 irregular regions, though variations exist. Some puzzles use a 1-star variant (one star per row/column/region) which is gentler. The 2-star variant described here is the standard and most commonly encountered version.

**Cross-hatching** is your primary tool. Pick a region and check which of its cells can still legally contain a star, given the stars already placed in its row, column, and adjacent cells. When a cell is eliminated by a star in the same row, same column, or an adjacent position, it cannot contain a star. Regions with few remaining legal cells are your best targets. **Adjacency elimination** works by placing an "X" in every cell that is adjacent to a placed star. This visual clearing makes the remaining options obvious. Many solvers mark eliminated cells with dots or X marks. Get into the habit of immediately marking all cells eliminated by each new star placement. **Region analysis** focuses on regions that have very few cells available for stars. A region with only two or three remaining legal cells forces star placements immediately. Small regions (those with only 4-6 cells total) are especially constrained because the two stars must not be adjacent within the region, which limits their relative positions severely.

**Forced placements** occur when the combined constraints of rows, columns, and regions leave exactly two legal cells for a star. When a row has 8 cells eliminated and only 2 remain, both must contain stars. The same logic applies to columns and regions. Track the "star count" for each row, column, and region to identify which ones are nearly complete. **Counting stars** is a powerful technique. Each row, column, and region needs exactly 2 stars. If a row already has 2 stars, every remaining cell in that row is eliminated. If a row has 1 star and only 3 legal cells remain, one of those 3 must contain the second star. This constraint propagates to the regions and columns that overlap those cells, often forcing placements elsewhere. **Combined constraint analysis** looks at the intersection of two or more constraints. If a region needs 2 stars and they must go into a specific set of cells, check which rows and columns those cells belong to. If both cells are in the same column, that column's star requirement is immediately satisfied by this region alone, eliminating all other cells in that column.

**Thinking ahead** means considering the implications of a star placement before committing. If you place a star in a particular cell, what does it force? Does it eliminate the last possible cell for a star in some region? If so, that placement is invalid. Expert solvers mentally test 2-3 placements ahead, quickly rejecting options that lead to contradictions. **Region interaction** is the key to the hardest puzzles. When two regions overlap heavily in the same rows and columns, their star placements are interdependent. Solving one region often directly resolves cells in the overlapping region. Map these interactions early by noting which regions share rows and columns. **Symmetry exploitation** can help in puzzles with symmetrical region layouts. If the regions have rotational or reflective symmetry, the solution often (though not always) shares that symmetry. This is not a guarantee, but it provides a useful starting hypothesis that you can test and adjust. Even when the solution is not perfectly symmetrical, the symmetrical structure of the grid constrains the possible solutions.