Computational complexity of two pencil puzzles: Kurotto and Juosan

DOI10.1007/978-3-030-90048-9_14MaRDI 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-complete; Juosan; Kurotto; pencil puzzle

Mathematics Subject Classification ID

91A80: Applications of game theory

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Cites Work

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