Chuzo IWAMOTO Tatsuya IDE
Nurimisaki and Sashigane are Nikoli's pencil puzzles. We study the computational complexity of Nurimisaki and Sashigane puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.
Terms of Service
Forgot Password?
Create Account now.
Create Account
Special Section
Information for Authors
Top 10 Downloads