You complete Shakashaka when all clue counts match and every connected unshaded polygon is an axis-aligned rectangle without notches or diagonal leaks. The full Shakashaka position determines the outcome; visual shortcuts never replace the documented Shakashaka terminal rule.
Your unfinished game is saved only in this browser.
You complete Shakashaka when all clue counts match and every connected unshaded polygon is an axis-aligned rectangle without notches or diagonal leaks. The full Shakashaka position determines the outcome; visual shortcuts never replace the documented Shakashaka terminal rule.
Complete guide
Shakashaka uses the independently implemented Nikoli Shakashaka rules v1 profile (R365). Shakashaka is a complete deterministic browser game built around triangular black marks placed in white cells so every remaining white area becomes a rectangle while numbered black clues count adjacent triangles.
Shakashaka begins with a grid containing fixed black clue squares and empty white cells that may receive one of four diagonal half-cell triangles. The Shakashaka deal identity and Nikoli Shakashaka rules v1 are stored together. Restarting Shakashaka reproduces this opening exactly.
During Shakashaka, you place, rotate, or remove a triangle in a white cell while respecting adjacent clue totals and the geometry of connected white space. The Shakashaka engine rejects profile violations, unavailable material, and every action attempted after Shakashaka reaches a terminal result.
You complete Shakashaka when all clue counts match and every connected unshaded polygon is an axis-aligned rectangle without notches or diagonal leaks. The full Shakashaka position determines the outcome; visual shortcuts never replace the documented Shakashaka terminal rule. In the Shakashaka endgame, inspect the final white component's boundary and rotate the remaining triangles until every side closes as a true rectangle. Check every remaining Shakashaka action before committing because its terminal rule is enforced immediately.
A reliable Shakashaka plan is to satisfy corner clues first and follow triangle edges to determine the only orientations that can complete neighbouring rectangles. A Shakashaka hint is legal and deterministic. The next Shakashaka hint exposes one bounded action; it never claims a forced Shakashaka win. A costly Shakashaka mistake is to count a triangle merely because it touches a clue diagonally; only triangles placed in orthogonally adjacent cells contribute. Undo supports studying that Shakashaka decision, while restart preserves the original seeded Shakashaka opening.
Shakashaka uses triangular black marks placed in white cells so every remaining white area becomes a rectangle while numbered black clues count adjacent triangles. That rule belongs to the Shakashaka engine and storage identity rather than a cosmetic preset.
A numbered black cell counts triangles in its orthogonally adjacent white cells, regardless of which way those triangles point.
Shakashaka records its game ID, rules version, and seeded deal identity. Those Shakashaka values recreate the same opening without a server request.