An article by Anastasia Onoprienko, "Np-Completeness of Hanabi Game with Minimal Parameters," has been published.

The article "NP-Completeness of the Hanabi Game with Minimal Parameters" by Anastasia Onoprienko has been published in the journal "Proceedings of the Russian Academy of Sciences. Mathematics, Informatics, Control Processes".

Abstract

We study the algorithmic complexity of the cooperative card game Hanabi. The feature of Hanabi is that playerssee each other’s cards but not their own, and exchange information through hints. Even in the model with oneplayer who has full information about the deck, Hanabi remains NP-hard. We found the minimal parametersofthe game that preserve NP-hardness. If these parameters are further reduced, the game turns out to be solvablein polynomial time.

 

Onoprienko A.A. NP-Completeness of the Hanabi Game with Minimal Parameters. Proceedings of the Russian Academy of Sciences. Mathematics, Informatics, Control Processes (formerly Doklady Akademii Nauk. Matematika). 2025. No. 527. Pp. 206–216. (The article is written in Russian.)