NP-Completeness of Hanabi Game with Minimal Parameters

IF 0.8 4区数学 Q3 MATHEMATICS

Doklady Mathematics Pub Date : 2026-03-02 DOI:10.1134/S1064562425700310

A. A. Onorpienko

引用次数: 0

Abstract

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

Abstract Image

查看原文本刊更多论文

最小参数Hanabi对策的np -完备性

研究了合作纸牌游戏“花比”的算法复杂度。《Hanabi》的一大特点是玩家可以看到其他玩家的卡片，但不能看到自己的卡片，并通过提示交换信息。即使在一个玩家拥有关于牌组的全部信息的模型中，Hanabi仍然具有np难度。我们找到了保持np硬度的最小游戏参数。如果这些参数进一步减小，博弈结果在多项式时间内可解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Doklady Mathematics 数学-数学

CiteScore

1.00

自引率

16.70%

发文量

审稿时长

3-6 weeks

期刊介绍： Doklady Mathematics is a journal of the Presidium of the Russian Academy of Sciences. It contains English translations of papers published in Doklady Akademii Nauk (Proceedings of the Russian Academy of Sciences), which was founded in 1933 and is published 36 times a year. Doklady Mathematics includes the materials from the following areas: mathematics, mathematical physics, computer science, control theory, and computers. It publishes brief scientific reports on previously unpublished significant new research in mathematics and its applications. The main contributors to the journal are Members of the RAS, Corresponding Members of the RAS, and scientists from the former Soviet Union and other foreign countries. Among the contributors are the outstanding Russian mathematicians.