IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Choco Banana is NP-complete
Chuzo IWAMOTOTakeru TOKUNAGA
Author information
JOURNAL FREE ACCESS Advance online publication

Article ID: 2023DML0001

Details
Abstract

Choco Banana is one of Nikoli's pencil puzzles. We study the computational complexity of Choco Banana. It is shown that deciding whether a given instance of the Choco Banana puzzle has a solution is NP-complete.

Content from these authors
© 2023 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top