Sorting by pile shuffles on queue-like and stack-like piles can be hard

TL;DR

This paper investigates the computational complexity of sorting using pile shuffles with mixed pile types and constraints, proving NP-Hardness for a general problem and introducing a novel automata-based analysis framework.

Contribution

It introduces a formal framework linking pile shuffle problems to finite automata and proves NP-Hardness for the general sorting problem with mixed pile types.

Findings

Proves NP-Hardness of the general pile shuffle sorting problem.

Introduces a novel automata-based framework for analyzing shuffle instances.

Discusses open problems and avenues for future research.

Abstract

Inspired by a common technique for shuffling a deck of cards on a table without riffling, we continue the study of a prequel paper on the pile shuffle and its capabilities as a sorting device. We study two sort feasibility problems of general interest concerning pile shuffle, first introduced in the prequel. These problems are characterized by: (1) bounds on the number of sequential rounds of shuffle, and piles created in each round; (2) the use of a heterogeneous mixture of queue-like and stack-like piles, as when each round of shuffle may have a combination of face-up and face-down piles; and (3) the ability of the dealer to choose the types of piles used during each round of shuffle. We prove by a sequence of reductions from the Boolean satisfiability problem (SAT) that the more general problem is NP-Hard. We leave as an open question the complexity of its arguably more natural companion, but discuss avenues for further investigation. Our analysis leverages a novel framework, introduced herein, which equates instances of shuffle to members of a particular class of deterministic finite automata.