Solving Shisen-Sho boards

10/18/2020
by   Michiel de Bondt, et al.
0

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.

READ FULL TEXT

page 7

page 11

page 12

page 13

research
06/21/2017

Solving the Rubik's Cube Optimally is NP-complete

In this paper, we prove that optimally solving an n × n × n Rubik's Cube...
research
04/08/2022

Finding a Winning Strategy for Wordle is NP-complete

In this paper, we give a formal definition of the popular word-guessing ...
research
02/15/2023

A new approach for a proof that P is NP

In this paper we propose a new approach for developing a proof that P=NP...
research
07/28/2018

Team Diagonalization

Ten years ago, Glaßer, Pavan, Selman, and Zhang [GPSZ08] proved that if ...
research
04/11/2019

P-Optimal Proof Systems for Each Set in NP but no Complete Disjoint NP-pairs Relative to an Oracle

Consider the following conjectures: - DisjNP: there exist no many-one ...
research
04/13/2023

The 2-Attractor Problem is NP-Complete

A k-attractor is a combinatorial object unifying dictionary-based compre...
research
11/30/2021

Towards algorithm-free physical equilibrium model of computing

Our computers today, from sophisticated servers to small smartphones, op...

Please sign up or login with your details

Forgot password? Click here to reset