Computational complexity of two pencil puzzles: Kurotto and Juosan (Q2695483)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of two pencil puzzles: Kurotto and Juosan |
scientific article |
Statements
Computational complexity of two pencil puzzles: Kurotto and Juosan (English)
0 references
31 March 2023
0 references
Kurotto
0 references
Juosan
0 references
pencil puzzle
0 references
NP-complete
0 references
