Computational Complexity of Two Pencil Puzzles: Kurotto and Juosan
Authors:
- 29 October 2021
- book chapter
- Published by Springer Nature
- p. 175-185
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Computational Complexity of Usowan PuzzlesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2018
- Dosun-Fuwari is NP-completeJournal of Information Processing, 2018
- The Complexity of Generalized Pipe Link PuzzlesJournal of Information Processing, 2017
- Zig-Zag Numberlink is NP-CompleteJournal of Information Processing, 2015
- Fillmat is NP-Complete and ASP-CompleteJournal of Information Processing, 2015
- Computational Complexity and an Integer Programming Model of ShakashakaIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2014
- Yosenabe is NP-completeJournal of Information Processing, 2014
- Kurodoko is NP-CompleteJournal of Information Processing, 2012
- Hashiwokakero is NP-completeInformation Processing Letters, 2009
- Games, Puzzles, and Computation2009