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.

中文翻译：

---

解决 Shisen-Sho 板

我们给出了一个简单的证明，证明确定 Shisen-Sho 板的可解性是 NP 完全的。此外，我们表明，在现实假设下，如果两个瓷砖形成一对可玩的对数时间，则可以计算。我们将测试对子可玩性的算法的实现与我之前用偷看解决麻将纸牌的算法相结合，以获得解决 Shisen-Sho 棋盘的算法。我们采样了几种 Shisen-Sho 和 Mahjong Solitaire 布局，以了解 Shisen-Sho 和 Mahjong Solitaire 的可解性。