Scrin is complete once every cell, edge, region, and fixed clue satisfies the numbered rectangles diagonal network completion test. The terminal check examines every relevant pile, cell, edge, room, and clue before awarding the result.
Your unfinished game is saved only in this browser.
Scrin is complete once every cell, edge, region, and fixed clue satisfies the numbered rectangles diagonal network completion test. The terminal check examines every relevant pile, cell, edge, room, and clue before awarding the result.
Complete guide
Scrin uses the independently implemented Scrin numbered rectangles diagonal network rules v1 profile (R657). In Scrin, the position revolves around this rule: Shade clue-sized rectangles that never share an edge, and make their corner-to-corner contacts form one unbranched diagonal cycle.
Scrin starts with its fixed information already marked and its editable spaces left for the player. Shade clue-sized rectangles that never share an edge, and make their corner-to-corner contacts form one unbranched diagonal cycle. Restart reconstructs the same opening from the stored game ID, rules version, and seed.
A move in Scrin is accepted only while it preserves every already-visible requirement. Shade clue-sized rectangles that never share an edge, and make their corner-to-corner contacts form one unbranched diagonal cycle. Failed validation leaves the move count, history, and board exactly as they were.
Scrin is complete once every cell, edge, region, and fixed clue satisfies the numbered rectangles diagonal network completion test. The terminal check examines every relevant pile, cell, edge, room, and clue before awarding the result. At the end of Scrin, recount the remaining destinations, marks, or connections before committing the narrowest move. The finish is accepted only when every cell, edge, region, and fixed clue satisfies the numbered rectangles diagonal network completion test.
Complete each clue-sized rectangle without edge contact, then inspect diagonal contacts as a graph and keep every rectangle at degree two in one cycle. A chain of diagonal rectangle contacts is not enough; branching, an endpoint, or a second cycle all violate the single unbranched network.
Complete each clue-sized rectangle without edge contact, then inspect diagonal contacts as a graph and keep every rectangle at degree two in one cycle. This matters specifically because shade clue-sized rectangles that never share an edge, and make their corner-to-corner contacts form one unbranched diagonal cycle.
A chain of diagonal rectangle contacts is not enough; branching, an endpoint, or a second cycle all violate the single unbranched network. Recheck the legal boundary before choosing a replacement move.
The winning condition for Scrin is precise: every cell, edge, region, and fixed clue satisfies the numbered rectangles diagonal network completion test. No hidden solution values are printed to justify the result; the rules engine validates the submitted position. Undo and redo expose alternative branches without revealing an authored answer.