An experiment of the complexity of sliding block puzzles by 2D heat flow in paramodulation

Ruo Ando; Yoshiyasu Takefuji

Home/Archive/arXiv

arXiv · 2201.03301

An experiment of the complexity of sliding block puzzles by 2D heat flow in paramodulation

Ruo Ando·Yoshiyasu Takefuji

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we present a curious experiment with the hot list strategy in solving sliding block puzzles by paramodulation. The hot list strategy is one of the look-ahead strategies using paramodulation in automated reasoning. We define two heat flows in the reasoning process - vertical with the hot list of permutations along the Y-axis and horizontal along the X-axis. In the experiment, we have generated 500 * 8 puzzles under the test of the solvability checking by counting inversions. We have obtained curious 2D and 3D plots of the complexity by defining heat flow with hot lists. We can distinguish a few groups in 500 boards (puzzles) based on the concept of heat-resisting.

Explore related subjects

cs.CC

Keep this discovery

BibTeX RIS

Ruo Ando, Yoshiyasu Takefuji. 2022-01-10. An experiment of the complexity of sliding block puzzles by 2D heat flow in paramodulation. https://arxiv.org/abs/2201.03301

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗