arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.09014cs.DScs.CCcs.DM
收藏

求解Shisen-Sho板

Solving Shisen-Sho boards

Michiel de Bondt

摘要:

给出了判定Shisen-Sho板的可解性是NP-完全的一个简单证明。此外,我们表明,在现实的假设下,可以计算在对数时间,如果两个瓷砖形成一个可播放的对。我们结合算法的实现来测试可玩性的对我的早期算法解决麻将纸牌游戏板偷看,以获得一个算法来解决Shisen-Sho板。我们对几种Shisen-Sho和Mahjong Solitaire布局进行了抽样,以了解Shisen-Sho和Mahjong Solitaire的可解性。

英文摘要:

We give a simple proof of that determining solvability of Shisen-Sho boards is NP-complete. Furthermore, we show that under realistic assumptions, one can compute in logarithmic time if two tiles form a playable pair. We combine an implementation of the algoritm to test playability of pairs with my earlier algorithm to solve Mahjong Solitaire boards with peeking, to obtain an algorithm to solve Shisen-Sho boards. We sample several Shisen-Sho and Mahjong Solitaire layouts for solvability for Shisen-Sho and Mahjong Solitaire.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑