Choco Banana is NP-Complete

Chuzo IWAMOTO; Takeru TOKUNAGA

doi:10.1587/transfun.2023DML0001

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

Favorites & Alerts

Recently viewed articles

Understanding Soanian occurrences at Bam locality of Siwalik frontal range, north-western India
Cryptanalysis of a GL(r,Z_n)-Based Public Key System
Fast Bit-Parallel Polynomial Basis Multiplier for GF(2^m) Defined by Pentanomials Using Weakly Dual Basis
Theoretical and Heuristic Synthesis of Digital Spiking Neurons for Spike-Pattern-Division Multiplexing
Sarsa Learning Based Route Guidance System with Global and Local Parameter Strategy

Announcements from publisher

IEICE Members can download the PDF from https://globals.ieice.org/en_transactions/fundamentals
PPV is available from https://globals.ieice.org/en_transactions/fundamentals
Please contact trans-a[a]ieice.org, if you want to unlock PDF security.

Corresponding author

Register with J-STAGE for free!