DeepAI AI Chat
Log In Sign Up

A Framework for Loop and Path Puzzle Satisfiability NP-Hardness Results

by   Hadyn Tang, et al.

Building on the results published in arxiv:2004.12849 we present a general framework for demonstrating the NP-hardness of satisfying many genres of loop and path puzzles using a 'T-metacell' gadget. We then use this to prove the NP-completeness of a variety of such genres, and discuss some of the limitations of this gadget.


page 1

page 2

page 3

page 4


On the NP-Completeness of Satisfying Certain Path and Loop Puzzles

"Eye-Witless", "Haisu" and "Oriental House" are genres of logic puzzles ...

A Note on Hardness Frameworks and Computational Complexity of Xiangqi and Janggi

We review NP-hardness framework and PSPACE-hardness framework for a type...

A Simpler NP-Hardness Proof for Familial Graph Compression

This document presents a simpler proof showcasing the NP-hardness of Fam...

PSPACE-completeness of Pulling Blocks to Reach a Goal

We prove PSPACE-completeness of all but one problem in a large space of ...

A syntactic tool for proving hardness in the Second Level of the Polynomial-Time Hierarchy

In the nineties Immerman and Medina initiated the search for syn- tactic...

Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect

We consider the computational complexity of reconfiguration problems, in...

NP-Completeness and Inapproximability of the Virtual Network Embedding Problem and Its Variants

Many resource allocation problems in the cloud can be described as a bas...