You complete Yajilin when all arrows see the stated number of black cells, black cells never share an edge, and one closed loop visits every remaining white non-clue cell. The full Yajilin position determines the outcome; visual shortcuts never replace the documented Yajilin terminal rule.
Your unfinished game is saved only in this browser.
You complete Yajilin when all arrows see the stated number of black cells, black cells never share an edge, and one closed loop visits every remaining white non-clue cell. The full Yajilin position determines the outcome; visual shortcuts never replace the documented Yajilin terminal rule.
Complete guide
Yajilin uses the independently implemented Nikoli Yajilin rules v1 profile (R367). Yajilin is a complete deterministic browser game built around one nonbranching loop through white cells plus arrow clues counting black cells in a direction, with black cells forbidden from touching orthogonally.
Yajilin begins with a grid containing fixed arrow clues and undecided ordinary cells that may become loop segments, black cells, or unused white cells. The Yajilin deal identity and Nikoli Yajilin rules v1 are stored together. Restarting Yajilin reproduces this opening exactly.
During Yajilin, you shade cells, draw orthogonal loop edges, and clear marks while checking arrow counts, black adjacency, cell degree, and premature cycles. The Yajilin engine rejects profile violations, unavailable material, and every action attempted after Yajilin reaches a terminal result.
You complete Yajilin when all arrows see the stated number of black cells, black cells never share an edge, and one closed loop visits every remaining white non-clue cell. The full Yajilin position determines the outcome; visual shortcuts never replace the documented Yajilin terminal rule. In the Yajilin endgame, use the last arrow count to decide black versus loop cells, then connect the two remaining loop ends without branching. Check every remaining Yajilin action before committing because its terminal rule is enforced immediately.
A reliable Yajilin plan is to satisfy short arrow ranges first, mark neighbours of forced black cells white, and propagate loop degree-two constraints from there. A Yajilin hint is legal and deterministic. The next Yajilin hint exposes one bounded action; it never claims a forced Yajilin win. A costly Yajilin mistake is to close a small valid cycle before all required white cells join it; Yajilin permits exactly one final loop. Undo supports studying that Yajilin decision, while restart preserves the original seeded Yajilin opening.
Yajilin uses one nonbranching loop through white cells plus arrow clues counting black cells in a direction, with black cells forbidden from touching orthogonally. That rule belongs to the Yajilin engine and storage identity rather than a cosmetic preset.
Arrow clue cells are never part of the loop or black set, and their count extends only in the indicated direction to the border.
Yajilin records its game ID, rules version, and seeded deal identity. Those Yajilin values recreate the same opening without a server request.