You complete Nurimisaki when all white cells connect, each cape has the required visibility, and every white dead end is a legitimate cape. The engine evaluates the full position rather than relying on a visual shortcut or an unsupported solvability claim.
Your unfinished game is saved only in this browser.
You complete Nurimisaki when all white cells connect, each cape has the required visibility, and every white dead end is a legitimate cape. The engine evaluates the full position rather than relying on a visual shortcut or an unsupported solvability claim.
Complete guide
Nurimisaki uses the independently implemented Nikoli Nurimisaki rules v1 profile (R467). Nurimisaki is a complete deterministic browser game whose distinct rules centre on a connected white network whose numbered cape cells see an exact straight distance while unnumbered dead ends are forbidden.
Nurimisaki opens from a versioned seeded position built for a connected white network whose numbered cape cells see an exact straight distance while unnumbered dead ends are forbidden. Its game ID, rules profile, and deal identity are stored together so restart recreates the same opening without a server request.
Every Nurimisaki action is checked against the current board, available material, and this defining restriction: visibility travels orthogonally until the first black cell or border, and numbered cape cells themselves are included in the count. Invalid, stale, or post-terminal actions leave the position unchanged.
You complete Nurimisaki when all white cells connect, each cape has the required visibility, and every white dead end is a legitimate cape. The engine evaluates the full position rather than relying on a visual shortcut or an unsupported solvability claim. Near the end of Nurimisaki, recount the remaining obligations needed until all white cells connect, each cape has the required visibility, and every white dead end is a legitimate cape. Check the boundary rule after every final placement or transfer because terminal status is enforced immediately.
A practical Nurimisaki plan is to preserve several legal continuations around a connected white network whose numbered cape cells see an exact straight distance while unnumbered dead ends are forbidden. Use the deterministic hint to inspect one legal action, then compare how it affects the documented objective before committing. A common Nurimisaki error is to ignore the boundary rule that visibility travels orthogonally until the first black cell or border, and numbered cape cells themselves are included in the count. Undo is useful for studying that decision, while restart deliberately preserves the original seeded position.
Nurimisaki has its own runtime and save identity because its rules require a connected white network whose numbered cape cells see an exact straight distance while unnumbered dead ends are forbidden.
visibility travels orthogonally until the first black cell or border, and numbered cape cells themselves are included in the count.
Nurimisaki stores its game ID, rules version, and seeded deal identity. Those values recreate the same opening locally without promising that the position is forced or winnable.