Tips for solving a Lits puzzle with tetromino shapes

A Lits puzzle asks you to divide shaded cells into connected four-square pieces called tetrominoes. The named forms are L, I, T and S. In the standard version, every outlined region contains one of each form, and two pieces of the same form cannot share an edge. Check your rule set for permitted rotations and reflections.

The format suits Australian puzzle culture: a train ride from Sydney, a quiet arvo at home, or a break between community events. The Australian Mathematics Competition has made logic familiar to school students, while puzzle books sold at newsagents and mainstream bookshops offer adults screen-free practice.

Many solvers begin by hunting for the longest straight run for the I piece. That instinct can feel productive, yet it often creates a dead end later. A stronger approach treats each region as a packing problem: place four interlocking polyominoes, respect the border, and keep the no-touch condition active from the first move.

Zagonetka.net, associated with the Croatian Logic Association, offers announcements, schedules, results, and practice material from Croatian and international events. Its varied grids provide useful preparation beyond casual newspaper puzzles. For Australian enthusiasts, the archive also opens a route into the wider tournament community.

Read the region and shape rules

Begin with the region borders, not the cell count. A standard region containing each tetromino once has 16 shaded cells, so use that as a checksum rather than shading any 16 squares. Connectivity and the L, I, T, S signatures must still fit. Mark narrow corridors, protrusions, and awkward corners before placing a piece.

Build a compact shape inventory instead of a mass of drawings. An I needs four cells in a line; an L has three in a line with a cell at one end; a T has three in a line with a cell at the middle; an S consists of two offset pairs. The square tetromino is excluded. Sketch allowed rotations, and use a flip only when the rules permit it.

Work from the most constrained region

Use a constrained-first order. Regions with narrow spans, tight corners, or awkward branches reveal forced placements faster than large open ones. Fit the most awkward tetromino first, then test whether the remaining space can accept the other three. If a region appears overfilled, revisit the placement that consumed a valuable corner or bridge rather than blaming the shape itself.

Count border pressure. A region edge limits rotation, making boundary cells valuable. An I may be forced along a four-cell channel, while an L or T needs room for its projecting cell. Taking one region at a time over a coffee break is often more effective than switching repeatedly across the whole grid.

Turn borders into forced placements

Ask what each boundary contact blocks. The three-cell stem of an L or T cannot extend outside its region, so a stem ending at a border fixes the location of its cap. The offset centre of an S needs room on both sides of its step. These intersections produce forced cells quickly where one border meets another.

Anchor a placement by its distinctive cell: the end of the long arm for L, an endpoint for I, the centre of the bar for T, or a bend cell for S. From there, list legal rotations and eliminate any crossing a border. The candidate list is usually shorter than it first appears, and every remaining option has a clear reason.

Apply the no-touch rule early

Use the no-touch rule from the first complete placement. Once an L exists, exclude any second L that would share an edge with it, even when an outlined region separates their cells. Apply the same test to I, T and S. This global restriction often removes more candidates than a region-by-region search does.

Keep edges and corners distinct. Diagonal contact is normally legal, so two T pieces meeting at a corner do not violate the rule, while aligned arms sharing an edge do. Drawing contact points prevents over-elimination. A pencil grid also helps in a Melbourne café, where seeing which squares touch is easier on paper than on a phone.

Test candidates in small batches

When no placement is forced, construct a small batch of candidates for the tightest region. Test each against border fit, shape validity and duplicate adjacency, then ask whether the remaining space can hold the other three pieces. Reject a candidate that creates an isolated pocket of one or two required cells instead of waiting for a late contradiction.

Backtrack after reducing the choices, not before. Mark rejected candidates with a light cross rather than erasing them, since the same placement may become relevant after another change. If every arrangement fails in a region, the error often lies in its first piece rather than its last. Place, check and revise; do not fill empty squares merely because they appear available.

Build a repeatable solving routine

Keep a routine that prevents visual clutter from turning into a false deduction. Shade only confirmed pieces, mark candidate orientations with small symbols, and record each elimination. That filtering principle is familiar from choosing a radio band: narrowing a noisy range makes useful signals easier to recognise. Separate notes for region fit and forbidden touching prevent one constraint from being applied twice by accident.

Timed grids of different sizes provide a useful final check, and comparing routes with another solver reveals overlooked deductions. Australian puzzle fans can borrow the event discipline of competitions associated with the Australian Mathematics Trust, while the Australian market for puzzle books supplies inexpensive, screen-free practice. Zagonetka’s tournament reports and practice sheets add harder regional patterns. Whether the grid sits on a Sydney train or beside an arvo coffee, consistent constraint checking beats fast guessing.