Computational complexity of two pencil puzzles: Kurotto and Juosan

DOI10.1007/978-3-030-90048-9_14OpenAlexW3210356593MaRDI QIDQ2695483

Tatsuaki Ibusuki, Chuzo Iwamoto

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90048-9_14

zbMATH Keywords

NP-completeJuosanKurottopencil puzzle

Mathematics Subject Classification ID

Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Hashiwokakero is NP-complete
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational complexity of two pencil puzzles: Kurotto and Juosan