解决麻将接龙板与偷看
Solving Mahjong Solitaire boards with peeking
摘要:
我们首先证明,即使只允许孤立的形式/aab/和/abb/的堆栈,解决麻将纸牌游戏板偷看是NP完全的。随后,我们发现,布局的孤立堆栈的高度1和2总是可以解决与偷看,这样做是在P,以及找到一个最佳算法,这样的布局没有偷看。接下来,我们描述了一个实用的算法来解决麻将纸牌牌偷看,这是简单和快速。该算法使用一个有效的修剪标准和启发式发现和优先级的关键组。该算法的思想也可以应用于求解带偷看的Shisen-Sho问题。
英文摘要:
We first prove that solving Mahjong Solitaire boards with peeking is NP-complete, even if one only allows isolated stacks of the forms /aab/ and /abb/. We subsequently show that layouts of isolated stacks of heights one and two can always be solved with peeking, and that doing so is in P, as well as finding an optimal algorithm for such layouts without peeking. Next, we describe a practical algorithm for solving Mahjong Solitaire boards with peeking, which is simple and fast. The algorithm uses an effective pruning criterion and a heuristic to find and prioritize critical groups. The ideas of the algorithm can also be applied to solving Shisen-Sho with peeking.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。