Use every clue to draw one loop whose edge counts satisfy clues and vertex degree rules; the shipped board has exactly one checked solution.
Slitherlink draws one continuous loop along grid edges. A numbered cell specifies how many of its four borders belong to the loop, and every lattice vertex must have degree zero or two. The line may not branch, stop, or form a smaller closed cycle before all required edges are included. A binary edge search propagates clue and vertex bounds, then verifies a single connected cycle and rejects non-unique boards.
Move the cursor between horizontal and vertical edges, then press OK to cycle undecided, line, and X. An X records that an edge is excluded and helps preserve deductions. Pointer input targets the nearest edge instead of the center of a clue cell. Reset returns every edge to undecided while leaving clue numbers visible. Line thickness and exclusion marks remain distinct at small canvas sizes.
Score comes from satisfied numeric clues, legal degree-two vertices, and extending the eventual loop without premature closure. A clue with too many lines or too few remaining possibilities is flagged and adds no progress. Random line density is therefore less valuable than consistent structure. Completion requires exactly one cycle satisfying every clue; only then is the final bonus added and the best score saved.
Around a zero, mark all four borders X immediately. Around a three, any excluded border forces the other three to be lines. At a vertex already touching two line edges, exclude every other incident edge; with one line and only one undecided exit, that exit is forced. Watch for a path whose ends are about to meet, and postpone that closing edge until every other line segment belongs to the same chain.
Edge snapping and directional navigation keep narrow segments selectable on a phone, while confirmation buttons retain the required touch height. The board fills portrait and short landscape viewports without hiding the clue field. Debug mode alternates line and exclusion deductions, restarting after the unique cycle is shown. render_game_to_text exposes clue counts, vertex degrees, open chain ends, premature cycles, edge states, cursor, score, and capped solver result.
Around a zero, mark all four borders X immediately.
Edge snapping and directional navigation keep narrow segments selectable on a phone, while confirmation buttons retain the required touch height.
Slitherlink Mini: Score comes from satisfied numeric clues, legal degree-two vertices, and extending the eventual loop without premature closure
Use every clue to draw one loop whose edge counts satisfy clues and vertex degree rules; the shipped board has exactly one checked solution.