Corpus ID: 212747848

# Tatamibari is NP-complete

@article{Adler2020TatamibariIN,
title={Tatamibari is NP-complete},
author={Aviv Adler and Jeffrey Bosboom and Erik D. Demaine and Martin L. Demaine and Quanquan C. Liu and Jayson Lynch},
journal={ArXiv},
year={2020},
volume={abs/2003.08331}
}
• Aviv Adler, +3 authors Jayson Lynch
• Published 2020
• Computer Science, Mathematics
• ArXiv
• In the Nikoli pencil-and-paper game Tatamibari, a puzzle consists of an $m \times n$ grid of cells, where each cell possibly contains a clue among +, -, |. The goal is to partition the grid into disjoint rectangles, where every rectangle contains exactly one clue, rectangles containing + are square, rectangles containing - are strictly longer horizontally than vertically, rectangles containing | are strictly longer vertically than horizontally, and no four rectangles share a corner. We prove… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 41 REFERENCES

## Spiral Galaxies Puzzles are NP-complete

• Erich Friedman Stetson
• 2002

## Computational complexity and an integer programming model of Shakashaka

• Mathematics, Computer Science
• CCCG
• 2013

## Games, puzzles and computation

• Mathematics, Computer Science
• 2006