Marupeke
Place circles and crosses in every cell without creating three in a row in any direction.
Basic Game Premise & Rules
MechanicsMarupeke is an untimed, deterministic pencil-and-paper logic puzzle played on a grid. Every valid puzzle has exactly one unique solution that can be discovered through rigorous deductive reasoning alone, without trial and error or guessing.
- The grid contains white playable cells, black obstacle cells, and some initial clue symbols (O and X).
- Fill every white cell with either an O or an X.
- Avoidance Rule: Three identical symbols (OOO or XXX) can never appear consecutively in any straight line—horizontally, vertically, or diagonally.
- Black obstacle cells are impassable barriers: they do not take a symbol, and they break lines (symbols separated by a black cell do not count as consecutive).
- Every board has a single unique solution deducible through spatial and Boolean logic.
Rules by Example
See how each rule looks when done correctly versus when violated:
No Three in a Row (Orthogonal & Diagonal)
Every cell contains an O or an X. Three identical symbols can never appear consecutively in any row, column, or diagonal line.
Black Cells Break Lines
Black obstacle cells break lines. Identical symbols separated by a black cell do not count as consecutive.
History & Origins
Origins & EvolutionMarupeke traces its cultural roots to the ancient Japanese game of Gomoku and the universal paper game Tic-Tac-Toe (known in Japan as *Maru-Batsu* or *Maru-Peke*, where *maru* means circle and *peke* or *batsu* signifies cross). In Japanese logic puzzle culture, designers inverted the competitive game: rather than trying to get three-in-a-row, the player must arrange symbols to systematically avoid creating three-in-a-row anywhere on the board.
The addition of strategic black obstacle blocks transformed the mechanic into a rich deductive puzzle. Marupeke has gained widespread popularity in educational mathematics and cognitive training programs across Asia and Europe because it develops sharp algebraic and spatial reasoning without requiring numerical computation or arithmetic operations.
Mathematical Concepts & Computational Complexity
Computer Science & Discrete MathBeyond its entertainment value, Marupeke formalizes core principles of discrete mathematics, theoretical computer science, and combinatorics:
Ramsey Theory & Combinatorial Pattern Avoidance
Marupeke is an applied realization of Ramsey Theory on discrete lattices, directly related to the Gallai-Witt Theorem and the Hales-Jewett Theorem. In an unconstrained square grid, Van der Waerden's theorem guarantees that any sufficiently large grid 2-coloring must contain monochromatic lines. Marupeke balances this tendency by introducing black obstacle cells that partition long lines into sub-critical segments of length < 3.
2-SAT Implication Graphs & Direct Deduction
Many fundamental Marupeke deductions reduce to 2-Satisfiability (2-SAT), which can be solved in linear time O(V + E): • Sandwich Pattern (X _ X): The middle cell must be O, representing the clause (¬x_1 ∨ ¬x_3 ∨ x_2). • Double Pair (_ X X): The adjacent empty cell must be O, representing (¬x_2 ∨ ¬x_3 ∨ x_1). Chains of diagonal and orthogonal interactions form implication cycles that can be analyzed via Strongly Connected Components.
Hypergraph 2-Coloring with Obstacles
The puzzle can be formalized as hypergraph 2-coloring: let V be the set of white cells, and let each maximal straight segment of 3 consecutive cells (horizontal, vertical, or diagonal unbroken by black cells) form a hyperedge e ∈ E of size 3. A valid solution is a vertex coloring c: V → {O, X} such that no hyperedge is monochromatic. Deciding whether an arbitrary hypergraph admits a 2-coloring is NP-complete by reduction from Not-All-Equal 3-SAT (NAE-3SAT).
Diagonal Geometry & Parity Constraints
Unlike standard row-column puzzles (like Sudoku or Binairo), Marupeke enforces constraints along all four diagonal families: main diagonals (r - c = k) and anti-diagonals (r + c = k). This creates a 4-regular constraint hypergraph over the cells, meaning a single cell assignment immediately influences up to 4 intersecting lines simultaneously.
References & Further Reading
Bibliography- Graham, R. L., Rothschild, B. L., & Spencer, J. H. (1990). Ramsey Theory (2nd ed.). John Wiley & Sons. ISBN: 978-0471500469.
- Schaefer, T. J. (1978). 'The complexity of satisfiability problems'. Proceedings of the 10th Annual ACM STOC, 216–226.
- Guy, R. K. (1991). Combinatorial Games. Proceedings of Symposia in Applied Mathematics, American Mathematical Society.
- Gardner, M. (1988). Hexaflexagons and Other Mathematical Diversions. University of Chicago Press.
- Aspvall, B., Plass, M. F., & Tarjan, R. E. (1979). 'A linear-time algorithm for testing the truth of certain quantified boolean formulas'. Information Processing Letters, 8(3), 121–123.
Free Printable PDF Booklet
Download our beautifully formatted, high-resolution A4 puzzle booklet. Generated directly from the handcrafted levels on AZTest, it contains 50 puzzles ordered from gentle introductory boards up to master-level challenges, followed by complete solutions at the back.
| Difficulty Stage | Grid Size | Description | Puzzles |
|---|---|---|---|
| Intro | 5×5 | Basic 3-in-a-row prevention across rows and columns. | 3 |
| Easy | 5×5 to 6×6 | Diagonal line tracking and obstacle boundary usage. | 12 |
| Medium | 7×7 to 8×8 | Interlocking orthogonal and diagonal forced chains. | 12 |
| Hard | 8×8 to 9×9 | Bifurcation and contradiction analysis across dense grids. | 12 |
| Expert | 9×9 to 10×10 | Grandmaster boards with minimal obstacles and long diagonals. | 11 |
Explore More Logic Puzzles
SeriesSlitherlink
Connect dots to draw a single unbroken loop guided by surrounding cell numbers.
Wolves & Sheep
Draw a Slitherlink loop that fences the gentle sheep in and keeps the fierce wolves out.
Masyu
Draw one closed loop through cell centres that rigorously obeys the black and white pearls.
Nurikabe
Shade the sea to leave numbered white islands of exact sizes in one connected ocean.
Nonogram
Shade runs of cells according to row and column number clues to reveal a hidden picture.
Themed Nonogram
Solve color picture cross puzzles that blossom into vibrant pixel art upon completion.
Hitori
Shade the repeated numbers until every row and column has unique digits, keeping all white cells connected.
Kurodoko
Shade cells so every numbered circle sees exactly that many white cells in its row and column.
Mosaic
Shade cells guided by numbers that count how many cells around them are filled, revealing a hidden picture.
Binairo
Fill every cell with blue or white circles: never three in a row, every line half and half.
Heyawake
Shade rooms according to their clues without isolating unshaded cells or leaving long straight corridors.
Searchlights
Place light beams in white cells so that every numbered black post sees its exact clue count.
Light Up
Place light bulbs to illuminate every white cell without any two shining on each other.
Calcudoku
A Latin square where every outlined cage satisfies its arithmetic target and operator.
Skyscrapers
Place towers of heights 1 to N so that each outside clue sees the exact count of buildings.
Sum Skyscrapers
Skyscrapers where each outside clue is the sum of the heights of all visible buildings.
Suguru
The elegant polyomino number puzzle where no two identical digits can touch, even diagonally.
Futoshiki
A Latin square puzzle with inequality signs pointing between neighboring numbers.
Fillomino
Divide the grid into polyomino blocks where each cell's number equals the area of its block.
Galaxies
Partition the grid into rotational 180° symmetric galaxies, each centered on a single dot.
Shikaku
Cut the whole grid into rectangles and squares, each containing exactly one number: its area.
L-Pieces
Draw borders to partition all white cells into perfect four-cell L-shapes.
Numberlink
Connect pairs of matching numbers with continuous non-crossing paths covering the grid.
Bridges
Connect the island network with straight horizontal and vertical bridges into one united world.
Slant
Draw a diagonal slash in every cell matching the corner numbers, without ever closing a loop.
Tents
Pitch a tent beside every tree with no two tents touching, matching row and column counts.